Inexact penalty decomposition methods for optimization problems with geometric constraints

DOI10.1007/s10589-023-00475-2zbMath1522.90079arXiv2210.05379MaRDI QIDQ6133301

Publication date: 24 July 2023

Published in: Computational Optimization and Applications (Search for Journal in Brave)

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

zbMATH Keywords

disjunctive programming cardinality constraints asymptotic regularity augmented Lagrangian low-rank optimization asymptotic stationarity penalty decomposition Mordukhovich-stationarity

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Set-valued and variational analysis (49J53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

Unnamed Item
Unnamed Item
Low rank approximation. Algorithms, implementation, applications
On the limited memory BFGS method for large scale optimization
Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
Maximum stable set formulations and heuristics based on continuous optimization
An example comparing the standard and safeguarded augmented Lagrangian methods
Convergent inexact penalty decomposition methods for cardinality-constrained problems
On nondegenerate M-stationary points for sparsity constrained nonlinear optimization
Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs
A concave optimization-based approach for sparse multiobjective programming
Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming
Tangent and normal cones for low-rank matrices
Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
Exact matrix completion via convex optimization
Lectures on Modern Convex Optimization
Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
Inexact block coordinate descent methods with application to non-negative matrix factorization
A Cone-Continuity Constraint Qualification and Algorithmic Consequences
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Lagrangean decomposition: A model yielding stronger lagrangean bounds
Globally convergent block-coordinate techniques for unconstrained optimization
Variational Analysis and Applications
Literature survey on low rank approximation of matrices
New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints
Optimality Conditions for Optimization Problems with Complementarity Constraints
A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
A Scalable Algorithm for Sparse Portfolio Selection
An Alternating Augmented Lagrangian method for constrained nonconvex optimization
On the linear independence constraint qualification in disjunctive programming
Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
Local and Global Analysis of Multiplier Methods for Constrained Optimization in Banach Spaces
Sparse Approximation via Penalty Decomposition Methods
Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
Convex analysis and monotone operator theory in Hilbert spaces
On sequential optimality conditions for smooth constrained optimization
Benchmarking optimization software with performance profiles.
An augmented Lagrangian method for optimization problems with structured geometric constraints

This page was built for publication: Inexact penalty decomposition methods for optimization problems with geometric constraints