Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case

DOI10.1080/10556788.2020.1854253OpenAlexW3107860607WikidataQ111899186 ScholiaQ111899186MaRDI QIDQ5058371

Francisco Facchinei, Vyacheskav Kungurtsev, Gesualdo Scutari, Lorenzo Lampariello

Publication date: 20 December 2022

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.16024

zbMATH Keywords

constrained optimizationnonconvex optimizationcomposite optimizationdiminishing stepsize

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items

A bilevel approach to ESG multi-portfolio selection

Cites Work

• Unnamed Item
• Hölder continuity of perturbed solution set for convex optimization problems
• Feasible methods for nonconvex nonsmooth problems with applications in green communications
• A sequential quadratic programming method for potentially infeasible mathematical programs
• Lipschitzian properties of multifunctions
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• Variational Analysis
• Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
• On High-order Model Regularization for Constrained Optimization
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Solving High-Order Portfolios via Successive Convex Approximation Algorithms
• Convex Analysis