The convergence properties of infeasible inexact proximal alternating linearized minimization
From MaRDI portal
Publication:6074854
Abstract: The proximal alternating linearized minimization method (PALM) suits well for solving block-structured optimization problems, which are ubiquitous in real applications. In the cases where subproblems do not have closed-form solutions, e.g., due to complex constraints, infeasible subsolvers are indispensable, giving rise to an infeasible inexact PALM (PALM-I). Numerous efforts have been devoted to analyzing feasible PALM, while little attention has been paid to PALM-I. The usage of PALM-I thus lacks theoretical guarantee. The essential difficulty of analyses consists in the objective value nonmonotonicity induced by the infeasibility. We study in the present work the convergence properties of PALM-I. In particular, we construct a surrogate sequence to surmount the nonmonotonicity issue and devise an implementable inexact criterion. Based upon these, we manage to establish the stationarity of any accumulation point and, moreover, show the iterate convergence and the asymptotic convergence rates under the assumption of the Lojasiewicz property. The prominent advantages of PALM-I on CPU time are illustrated via numerical experiments on problems arising from quantum physics and 3D anisotropic frictional contact.
Recommendations
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
- Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
- A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Cites work
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A block coordinate variable metric linesearch based proximal gradient method
- A Global Optimization Approach for Multimarginal Optimal Transport Problems with Coulomb Cost
- A note on error bounds for convex and nonconvex programs
- A trust region algorithm for equality constrained optimization
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
- Comparison of several fast algorithms for projection onto an ellipsoid
- Computational optimal transport. With applications to data sciences
- Convergence analysis of Oja's iteration for solving online PCA with nonzero-mean samples
- Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality
- Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
- Fast Algorithms for Projection on an Ellipsoid
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization
- Multimarginal Optimal Transport Maps for One–dimensional Repulsive Costs
- On gradients of functions definable in o-minimal structures
- On semi- and subanalytic geometry
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- On the Łojasiewicz--Simon gradient inequality.
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Topology optimization of structures considering local material uncertainties in additive manufacturing
- Unifying abstract inexact convergence theorems and block coordinate variable metric iPiano
- Variational Analysis
Cited in
(5)- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
- Optimization models and approaches for strongly correlated electrons systems
- Sampling-based methods for multi-block optimization problems over transport polytopes
This page was built for publication: The convergence properties of infeasible inexact proximal alternating linearized minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6074854)
