Image de couverture de livre

A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zeng, Hanfeng, Ouyang, Wenqing, Milzarek, Andre
Format:	Preprint
Publié:	2026
Sujets:	Optimization and Control 90C30, 90C53, 90C06, 65K05
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Variational Properties of Decomposable Functions. Part I: Strict Epi-Calculus and Applications
par: Ouyang, Wenqing, et autres
Publié: (2023)

Variational Properties of Decomposable Functions. Part II: Strong Second-Order Theory
par: Ouyang, Wenqing, et autres
Publié: (2023)

A MINRES-based Linesearch Algorithm for Nonconvex Optimization with Non-positive Curvature Detection
par: Zeng, Hanfeng, et autres
Publié: (2026)

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
par: Gfrerer, H.
Publié: (2024)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
par: Mannel, Florian
Publié: (2024)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
par: Deng, Kangkang, et autres
Publié: (2024)

A non-monotone trust-region method with noisy oracles and additional sampling
par: Krejic, Natasa, et autres
Publié: (2023)

A structured L-BFGS method and its application to inverse problems
par: Mannel, Florian, et autres
Publié: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
par: Mannel, Florian, et autres
Publié: (2024)

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
par: Themelis, Andreas, et autres
Publié: (2020)

Safeguarding adaptive methods: global convergence of Barzilai-Borwein and other stepsize choices
par: Ou, Hongjia, et autres
Publié: (2024)

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
par: Dahl, Simeon vom, et autres
Publié: (2026)

A penalty barrier framework for nonconvex constrained optimization
par: De Marchi, Alberto, et autres
Publié: (2024)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
par: Marumo, Naoki
Publié: (2025)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
par: Deng, Kangkang, et autres
Publié: (2025)

Hybrid optimal control with mixed-integer Lagrangian methods
par: Nikitina, Viktoriya, et autres
Publié: (2024)

A Unified Zeroth-Order Proximal Newton-Type Framework for Composite Optimization
par: Liu, Zekun, et autres
Publié: (2026)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
par: Song, Yongcun, et autres
Publié: (2024)

On the convergence of proximal gradient methods for convex simple bilevel optimization
par: Latafat, Puya, et autres
Publié: (2023)

Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis
par: De Marchi, Alberto
Publié: (2024)

A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction
par: Milzarek, Andre, et autres
Publié: (2022)

Nonsmooth exact penalty methods for equality-constrained optimization: complexity and implementation
par: Diouane, Youssef, et autres
Publié: (2024)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
par: Li, Qia, et autres
Publié: (2024)

Mixed-integer linearity in nonlinear optimization: a trust region approach
par: De Marchi, Alberto
Publié: (2023)

Randomized block proximal method with locally Lipschitz continuous gradient
par: Pérez-Aros, Pedro, et autres
Publié: (2025)

A new envelope function for nonsmooth DC optimization
par: Themelis, Andreas, et autres
Publié: (2020)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
par: Marumo, Naoki, et autres
Publié: (2023)

Adaptive Inertial Method
par: Long, Han, et autres
Publié: (2025)

A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
par: Ahookhosh, Masoud, et autres
Publié: (2019)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
par: Dolgopolik, M. V.
Publié: (2021)

Local properties and augmented Lagrangians in fully nonconvex composite optimization
par: De Marchi, Alberto, et autres
Publié: (2023)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
par: Zhou, Junpeng, et autres
Publié: (2025)

A Lasry-Lions envelope approach for mathematical programs with complementarity constraints
par: Wang, Jia, et autres
Publié: (2025)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
par: Kabgani, Alireza, et autres
Publié: (2024)

Practical Regularized Quasi-Newton Methods with Inexact Function Values
par: Hamaguchi, Hiroki, et autres
Publié: (2026)

Technical results on the convergence of quasi-Newton methods for nonsmooth optimization
par: Gebken, Bennet
Publié: (2025)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
par: Takahashi, Shota, et autres
Publié: (2025)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
par: Latafat, Puya, et autres
Publié: (2023)

Adaptive proximal gradient methods are universal without approximation
par: Oikonomidis, Konstantinos A., et autres
Publié: (2024)

Stability and convergence analysis of AdaGrad for non-convex optimization via novel stopping time-based techniques
par: Jin, Ruinan, et autres
Publié: (2024)