# Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs

arXiv: https://arxiv.org/abs/1409.8147 · HTML: https://mlsanity.com/paper/1409.8147/

## Key facts

- Cited by 10 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 29 Sep 2014.

## Built on by (most cited first, 10 of 10)

- [Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained Optimization](https://mlsanity.com/paper/2301.13314/) (2023)
- [Convex Optimization for Parameter Synthesis in MDPs](https://mlsanity.com/paper/2107.00108/) (2021)
- [Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs](https://mlsanity.com/paper/2306.16761/) (2023)
- [Convergence Analysis of Mean Shift](https://mlsanity.com/paper/2305.08463/) (2023)
- [Towards An Efficient Approach for the Nonconvex ℓp Ball Projection: Algorithm and Analysis](https://mlsanity.com/paper/2101.01350/) (2021)
- [Convex Clustering through MM: An Efficient Algorithm to Perform Hierarchical Clustering](https://mlsanity.com/paper/2211.01877/) (2022)
- [Convergence Analysis of Blurring Mean Shift](https://mlsanity.com/paper/2402.15146/) (2024)
- [A proximal-proximal majorization-minimization algorithm for nonconvex tuning-free robust regression problems](https://mlsanity.com/paper/2106.13683/) (2021)
- [An inexact LPA for DC composite optimization and application to matrix completions with outliers](https://mlsanity.com/paper/2303.16822/) (2023)
- [Fast Deep Predictive Coding Networks for Videos Feature Extraction without Labels](https://mlsanity.com/paper/2409.04945/) (2024)

## Abstract (arXiv)

In view of solving nonsmooth and nonconvex problems involving complex constraints (like standard NLP problems), we study general maximization-minimization procedures produced by families of strongly convex sub-problems. Using techniques from semi-algebraic geometry and variational analysis -in particular Lojasiewicz inequality- we establish the convergence of sequences generated by this type of schemes to critical points. The broad applicability of this process is illustrated in the context of NLP. In that case critical points coincide with KKT points. When the data are semi-algebraic or real analytic our method applies (for instance) to the study of various SQP methods: the moving balls method, Sl1QP, ESQP. Under standard qualification conditions, this provides -to the best of our knowledge- the first general convergence results for general nonlinear programming problems. We emphasize the fact that, unlike most works on this subject, no second-order assumption and/or convexity assumptions whatsoever are made. Rate of convergence are shown to be of the same form as those commonly encountered with first order methods.