Convergence analysis of inexact MBA method for constrained upper-$\mathcal{C}^2$ optimization problems
Preprint
Abstract
This paper concerns a class of constrained optimization problems in which, the objective and constraint functions are both upper-$\mathcal{C}^2$. For such nonconvex and nonsmooth optimization problems, we develop an inexact moving balls approximation (MBA) method by a workable inexactness criterion for the solving of subproblems. By leveraging a global error bound for the strongly convex program associated with parametric optimization problems, we establish the full convergence of the iterate sequence under the partial bounded multiplier property (BMP) and the Kurdyka-Łojasiewicz (KL) property of the constructed potential function, and achieve the local convergence rate of the iterate and objective value sequences if the potential function satisfies the KL property of exponent $q\in[1/2,1)$. A verifiable condition is also provided to check whether the potential function satisfies the KL property of exponent $q\in[1/2,1)$ at the given critical point. To the best of our knowledge, this is the first implementable inexact MBA method with a full convergence certificate for the constrained nonconvex and nonsmooth optimization problem.
Keywords
All Related Versions
This publication has 25 references indexed in Scilit:
- The Boosted Double-proximal Subgradient Algorithm for nonconvex optimizationMathematical Programming, 2025
- Level constrained first order methods for function constrained optimizationMathematical Programming, 2024
- Kurdyka–Łojasiewicz Exponent via Inf-projectionFoundations of Computational Mathematics, 2021
- Calculus of the Exponent of Kurdyka–Łojasiewicz Inequality and Its Applications to Linear Convergence of First-Order MethodsFoundations of Computational Mathematics, 2017
- Proximal alternating linearized minimization for nonconvex and nonsmooth problemsMathematical Programming, 2013
- Robust inversion, dimensionality reduction, and randomized samplingMathematical Programming, 2012
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methodsMathematical Programming, 2011
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic featuresMathematical Programming, 2007
- The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization ProblemsAnnals of Operations Research, 2005
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programsApplied Mathematics & Optimization, 1988