Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs
From MaRDI portal
Publication:2806813
DOI10.1287/moor.2015.0735zbMath1338.65156arXiv1409.8147OpenAlexW1855462127MaRDI QIDQ2806813
Publication date: 19 May 2016
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.8147
nonlinear programmingSQP methodsmajorization-minimizationKKT pointsKL inequalitytame optimizationconverging methodsextended sequential quadratic methodmoving balls methodS\(\ell^1\)QP
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of successive quadratic programming type (90C55)
Related Items
Feasible methods for nonconvex nonsmooth problems with applications in green communications ⋮ Local convergence of the heavy-ball method and iPiano for non-convex optimization ⋮ An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming ⋮ Composite Difference-Max Programs for Modern Statistical Estimation Problems ⋮ Qualification Conditions in Semialgebraic Programming ⋮ From error bounds to the complexity of first-order descent methods for convex functions ⋮ Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms ⋮ Harnessing Structure in Composite Nonsmooth Minimization ⋮ The multiproximal linearization method for convex composite problems ⋮ Doubly iteratively reweighted algorithm for constrained compressed sensing models ⋮ Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints ⋮ The value function approach to convergence analysis in composite optimization ⋮ Convergence analysis of a proximal point algorithm for minimizing differences of functions ⋮ Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano ⋮ A proximal DC approach for quadratic assignment problem ⋮ Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian ⋮ Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence ⋮ Composite Optimization by Nonconvex Majorization-Minimization ⋮ Variable Metric Forward-Backward Algorithm for Composite Minimization Problems ⋮ Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization ⋮ Unnamed Item ⋮ Efficiency of minimizing compositions of convex functions and smooth maps ⋮ Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity ⋮ A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima ⋮ SABRINA: a stochastic subspace majorization-minimization algorithm ⋮ Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems ⋮ Stochastic proximal linear method for structured non-convex problems ⋮ The proximity operator of the log-sum penalty ⋮ Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Dual subgradient algorithms for large-scale nonsmooth learning problems
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- A globally convergent method for nonlinear programming
- On gradients of functions definable in o-minimal structures
- Constraint identification and algorithm stabilization for degenerate nonlinear programs
- Introductory lectures on convex optimization. A basic course.
- A robust sequential quadratic programming method
- Geometric categories and o-minimal structures
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations
- A Majorize-Minimize Subspace Approach for $\ell_2-\ell_0$ Image Regularization
- Sequential Quadratic Programming Methods
- A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Clarke Subgradients of Stratifiable Functions
- An Invitation to Tame Optimization
- Ekeland's variational principle and the mountain pass lemma
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Active Sets, Nonsmoothness, and Sensitivity
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- On the Convergence of Successive Linear-Quadratic Programming Algorithms
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- On search directions for minimization algorithms
- On the Sequential Quadratically Constrained Quadratic Programming Methods
- A method for the solution of certain non-linear problems in least squares
