Partial augmented Lagrangian method for non-Lipschitz mathematical programs with complementarity constraints
From MaRDI portal
Cites work
- A convergent iterative support shrinking algorithm for non-Lipschitz multi-phase image labeling model
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- A new augmented Lagrangian method for MPCCs -- theoretical and numerical comparison with existing augmented Lagrangian methods
- A relaxed constant positive linear dependence constraint qualification and applications
- A robust SQP method for mathematical programs with linear complementarity constraints
- A smoothing method for a mathematical program with P-matrix linear complementarity constraints
- Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem
- An accelerated augmented Lagrangian algorithm with adaptive orthogonalization strategy for bound and equality constrained quadratic programming and its application to large-scale contact problems of elasticity
- An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
- An augmented Lagrangian method for non-Lipschitz nonconvex programming
- An extended proximal ADMM algorithm for three-block nonconvex optimization problems
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Augmented Lagrangian functions for constrained optimization problems
- Bilevel optimization. Advances and next challenges
- Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints
- Convex two-level optimization
- Decision bounding problems for two-stage distributionally robust stochastic bilevel optimization
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- First order necessary optimality conditions for mathematical programs with second-order cone complementarity constraints
- Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints.
- Global convergence of augmented Lagrangian methods applied to optimization problems with degenerate constraints, including problems with complementarity constraints
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- New relaxation method for mathematical programs with complementarity constraints
- Nonconvex TV^q-models in image restoration: analysis and a trust-region regularization-based superlinearly convergent solver
- Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming
- Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
- Partial augmented Lagrangian method and mathematical programs with complementarity constraints
- Sensitivity analysis of the value function for parametric mathematical programs with equilibrium constraints
- Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
- Smoothing methods for nonsmooth, nonconvex minimization
- Solving bilevel programs based on lower-level Mond-Weir duality
- Solving Stochastic Optimization with Expectation Constraints Efficiently by a Stochastic Augmented Lagrangian-Type Algorithm
- Sparse solutions of linear complementarity problems
- Stability analysis for parametric mathematical programs with geometric constraints and its applications
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
This page was built for publication: Partial augmented Lagrangian method for non-Lipschitz mathematical programs with complementarity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6966829)
