Global convergence of a smooth approximation method for mathematical programs with complementarity constraints
From MaRDI portal
Publication:857941
DOI10.1007/s00186-006-0076-2zbMath1132.90370OpenAlexW2014704055MaRDI QIDQ857941
Zhang, Jianzhong, Hong-Xia Yin
Publication date: 5 January 2007
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-006-0076-2
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (6)
Existence of solution and algorithms for a class of bilevel variational inequalities with hierarchical nesting structure ⋮ A smoothing SAA method for a stochastic mathematical program with complementarity constraints. ⋮ The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints ⋮ The Convergence of a Levenberg–Marquardt Method for Nonlinear Inequalities ⋮ A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function ⋮ A sample average approximation regularization method for a stochastic mathematical program with general vertical complementarity constraints
Cites Work
- On the convergence of the exponential multiplier method for convex programming
- Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints.
- An aggregate function method for nonlinear programming
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
- A smoothing method for mathematical programs with equilibrium constraints
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- A numerical approach to optimization problems with variational inequality constraints
- A non-interior continuation method for generalized linear complementarity problems
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- 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
- Optimization and nonsmooth analysis
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- A Smoothing Newton Method for Extended Vertical Linear Complementarity Problems
- Optimality Conditions for Optimization Problems with Complementarity Constraints
- Coordination Complexity of Parallel Price-Directive Decomposition
- An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
- A generalization of the linear complementarity problem
- How Stringent is the Linear Independence Assumption for Mathematical Programs with Complementarity Constraints?
This page was built for publication: Global convergence of a smooth approximation method for mathematical programs with complementarity constraints
