A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints
From MaRDI portal
Publication:5290836
DOI10.1080/01630560500538797zbMath1119.90051OpenAlexW2095246905MaRDI QIDQ5290836
No author found.
Publication date: 3 May 2006
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630560500538797
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Convergence of a class of penalty methods for constrained scalar set-valued optimization ⋮ On solving difference of convex functions programs with linear complementarity constraints ⋮ Global convergence of augmented Lagrangian method applied to mathematical program with switching constraints ⋮ An objective penalty function of bilevel programming ⋮ Improved Convergence Properties of the Relaxation Schemes of Kadrani et al. and Kanzow and Schwartz for MPEC ⋮ A log-exponential smoothing method for mathematical programs with complementarity constraints ⋮ Gauss-Seidel method for multi-leader-follower games ⋮ Lifting mathematical programs with complementarity constraints ⋮ A quadratic objective penalty function for bilevel programming ⋮ Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs ⋮ A modified relaxation scheme for mathematical programs with complementarity constraints ⋮ Partial augmented Lagrangian method and mathematical programs with complementarity constraints ⋮ A globally convergent algorithm for MPCC ⋮ Reformulation of the M-Stationarity Conditions as a System of Discontinuous Equations and Its Solution by a Semismooth Newton Method ⋮ Coupled versus decoupled penalization of control complementarity constraints ⋮ Tikhonov regularization for mathematical programs with generalized complementarity constraints
Cites Work
- Unnamed Item
- Unnamed Item
- OPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
- Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
- A smoothing method for mathematical programs with equilibrium constraints
- An exterior point method for computing points that satisfy second-order necessary conditions for a \(C^{1,1}\) optimization problem
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- On the continuity of the minimum set of a continuous function
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- On Optimization Problems with Variational Inequality Constraints
- On second-order directional derivatives
- How Stringent is the Linear Independence Assumption for Mathematical Programs with Complementarity Constraints?
- Set-valued analysis
