A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems

DOI10.1137/18M1190689zbMath1431.65088arXiv1805.11056MaRDI QIDQ5231666

Dang-Khoa Nguyen, Radu Ioan Boţ, Ernö Robert Csetnek

Publication date: 27 August 2019

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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

zbMATH Keywords

proximal algorithmlimiting subdifferentialKurdyka-Łojasiewicz propertyfull splitting schemestructured nonconvex and nonsmooth optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Related Items (9)

Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems ⋮ A forward-backward dynamical approach for nonsmooth problems with block structure coupled by a smooth function ⋮ A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems ⋮ Variational models for color image correction inspired by visual perception and neuroscience ⋮ ADMM-Type Methods for Generalized Nash Equilibrium Problems in Hilbert Spaces ⋮ Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems ⋮ A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization ⋮ A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization ⋮ A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima

Cites Work

• Unnamed Item
• Unnamed Item
• An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
• An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• On the linear convergence of the alternating direction method of multipliers
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Computing proximal points of nonconvex functions
• On gradients of functions definable in o-minimal structures
• Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
• Global convergence of ADMM in nonconvex nonsmooth optimization
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization
• Clarke Subgradients of Stratifiable Functions
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• Variational Analysis
• First-Order Methods in Optimization
• Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence
• Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
• Alternating Projections on Manifolds
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Signal Recovery by Proximal Forward-Backward Splitting
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems