Convergent Nested Alternating Minimization Algorithms for Nonconvex Optimization Problems

DOI10.1287/MOOR.2022.1256MaRDI QIDQ6118319zbMATH OpenOpenAlexFDO

Authors Eyal Gur, Shoham Sabach, Shimrit Shtern

Publication date 23 February 2024

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.2022.1256

zbMATH Keywords

global convergencenested algorithmsnonconvex and nonsmooth minimizationnondescent methodsnonsmooth Kurdyka-Łojasiewicz property

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• Nested alternating minimization with FISTA for non-convex and non-smooth optimization problems
• A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems
• An alternating augmented Lagrangian method for constrained nonconvex optimization

Cited in

(2)

• A proximal alternating direction method of multipliers with a proximal-perturbed Lagrangian function for nonconvex and nonsmooth structured optimization
• The PLADMM algorithm for solving structured composite optimization and its application in chiplet placement problem

This page was built for publication: Convergent Nested Alternating Minimization Algorithms for Nonconvex Optimization Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6118319)