An augmented Lagrangian method for optimization problems with structured geometric constraints (Q6038673)

scientific article; zbMATH DE number 7681278

Language	Label	Description	Also known as
English	An augmented Lagrangian method for optimization problems with structured geometric constraints	scientific article; zbMATH DE number 7681278

Statements

instance of

scholarly article

0 references

title

An augmented Lagrangian method for optimization problems with structured geometric constraints (English)

0 references

0 references

0 references

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

2 May 2023

0 references

full work available at URL

https://arxiv.org/abs/2105.08317

0 references

zbMATH Keywords

asymptotic regularity

0 references

augmented Lagrangian method

0 references

cardinality constraints

0 references

complementarity constraints

0 references

MAXCUT problem

0 references

Mordukhovich-stationarity

0 references

nonmonotone projected gradient method

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications

0 references

On Augmented Lagrangian Methods with General Lower-Level Constraints

0 references

On Optimality Conditions for Nonlinear Conic Programming

0 references

A relaxed constant positive linear dependence constraint qualification and applications

0 references

New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences

0 references

Optimality conditions and global convergence for nonlinear semidefinite programming

0 references

A Cone-Continuity Constraint Qualification and Algorithmic Consequences

0 references

Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization

0 references

Convergence Properties of a Second Order Augmented Lagrangian Method for Mathematical Programs with Complementarity Constraints

0 references

Two-Point Step Size Gradient Methods

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

Restricted normal cones and sparsity optimization with affine constraints

0 references

Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms

0 references

Lectures on Modern Convex Optimization

0 references

Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs

0 references

New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints

0 references

Q3690580

0 references

Practical Augmented Lagrangian Methods for Constrained Optimization

0 references

Nonmonotone Spectral Projected Gradient Methods on Convex Sets

0 references

New Constraint Qualifications for Optimization Problems in Banach Spaces Based on Asymptotic KKT Conditions

0 references

Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method

0 references

Exact matrix completion via convex optimization

0 references

Constraint qualifications and optimality conditions for optimization problems with cardinality constraints

0 references

SOC functions and their applications

0 references

An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming

0 references

Penalty Methods for a Class of Non-Lipschitz Optimization Problems

0 references

A relaxed constant positive linear dependence constraint qualification for mathematical programs with equilibrium constraints

0 references

Q4868581

0 references

Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints

0 references

SDP diagonalizations and perspective cuts for a class of nonseparable MIQP

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

A Nonmonotone Line Search Technique for Newton’s Method

0 references

A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods

0 references

Notes on some constraint qualifications for mathematical programs with equilibrium constraints

0 references

Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs

0 references

Reformulation of the M-Stationarity Conditions as a System of Discontinuous Equations and Its Solution by a Semismooth Newton Method

0 references

The limiting normal cone of a complementarity set in Sobolev spaces

0 references

On the Calmness of a Class of Multifunctions

0 references

Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints

0 references

Tangent and normal cones for low-rank matrices

0 references

Global Convergence of Augmented Lagrangian Methods Applied to Optimization Problems with Degenerate Constraints, Including Problems with Complementarity Constraints

0 references

Relaxation schemes for mathematical programmes with switching constraints

0 references

An augmented Lagrangian method for cardinality-constrained optimization problems

0 references

Sequential optimality conditions for cardinality-constrained optimization problems with applications

0 references

The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited

0 references

An example comparing the standard and safeguarded augmented Lagrangian methods

0 references

Optimality conditions and exact penalty for mathematical programs with switching constraints

0 references

Prox-regularity of rank constraint sets and implications for algorithms

0 references

Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming

0 references

A comparison of solution approaches for the numerical treatment of or-constrained optimization problems

0 references

On the linear independence constraint qualification in disjunctive programming

0 references

The limiting normal cone to pointwise defined sets in Lebesgue spaces

0 references

Variational Analysis and Applications

0 references

Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results

0 references

Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences

0 references

The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem

0 references

Some continuity properties of polyhedral multifunctions

0 references

Variational Analysis

0 references

Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints

0 references

Sparse Reconstruction by Separable Approximation

0 references

Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs

0 references

Identifiers

zbMATH Open document ID

0 references

0 references

10.1007/s10107-022-01870-z

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6038673