A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function
From MaRDI portal
Publication:1721022
DOI10.1155/2018/5056148zbMath1427.90259OpenAlexW2887315691WikidataQ115521984 ScholiaQ115521984MaRDI QIDQ1721022
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/5056148
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
On linear problems with complementarity constraints ⋮ A smoothing Newton method with a mixed line search for monotone weighted complementarity problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A log-exponential smoothing method for mathematical programs with complementarity constraints
- A new smoothing scheme for mathematical programs with complementarity constraints
- Lifting mathematical programs with complementarity constraints
- Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
- A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints
- Global convergence of a smooth approximation method for mathematical programs with complementarity constraints
- A class of smoothing methods for mathematical programs with complementarity constraints
- A new smoothing technique for mathematical programs with equilibrium constraints
- Partial exact penalty 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
- Some exact penalty results for nonlinear programs and mathematical programs with equilibrium constraints
- Further investigation on feasibility of mathematical programs with equilibrium constraints
- A modified relaxation scheme for mathematical programs with complementarity constraints
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- A hybrid conjugate gradient method with descent property for unconstrained optimization
- A partially smoothing Jacobian method for nonlinear complementarity problems with \(P_0\) function
- A strongly and superlinearly convergent SQP algorithm for optimization problems with linear complementarity constraints
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
- An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems
- A Cone-Continuity Constraint Qualification and Algorithmic Consequences
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method
- A New Regularization Scheme for Mathematical Programs with Complementarity Constraints
- An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
- New BFGS method for unconstrained optimization problem based on modified Armijo line search
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Convergence of an Inexact Smoothing Method for Mathematical Programs with Equilibrium Constraints
- Mathematical Programs with Equilibrium Constraints
- A new nonmonotone line search technique for unconstrained optimization
