Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints
DOI10.1007/S10898-017-0539-4zbMATH Open1394.90469OpenAlexW2624941576MaRDI QIDQ683732FDOQ683732
Authors: Jin Zhang, Caihua Chen, Su-Hong Jiang, Guihua Lin 
Publication date: 9 February 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0539-4
Recommendations
- Partial exact penalty for mathematical programs with equilibrium constraints
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- A new smoothing technique for mathematical programs with equilibrium constraints
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- Convergence of an Inexact Smoothing Method for Mathematical Programs with Equilibrium Constraints
MPECM-stationaritypartial penalty methodproximal alternating linearized minimization methodS-stationarity
Methods of successive quadratic programming type (90C55) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Variational Analysis
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Optimization and nonsmooth analysis
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- A Generalized Mathematical Program with Equilibrium Constraints
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- A smoothing method for mathematical programs with equilibrium constraints
- A modified relaxation scheme for mathematical programs with complementarity constraints
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- Mathematical Programs with Equilibrium Constraints
- An Invitation to Tame Optimization
- On the Guignard constraint qualification for mathematical programs with equilibrium constraints
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Partial exact penalty for mathematical programs with equilibrium constraints
- Hybrid approach with active set identification for mathematical programs with complementarity constraints
- Optimality Conditions for Optimization Problems with Complementarity Constraints
- Model selection for primal SVM
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Cited In (6)
- Title not available (Why is that?)
- A new smoothing technique for mathematical programs with equilibrium constraints
- A smoothing method for mathematical programs with equilibrium constraints
- A \(\mathcal{UV}\)-decomposed method for solving an MPEC problem
- A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function
- Partial exact penalty for mathematical programs with equilibrium constraints
This page was built for publication: Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683732)
