Some properties of regularization and penalization schemes for MPECs
From MaRDI portal
(Redirected from Publication:4657706)
Recommendations
- A penalty method and a regularization strategy to solve MPCC
- scientific article; zbMATH DE number 841067
- Regularized penalty method for general equilibrium problems in Banach spaces
- Asymptotic properties of penalized objective functions in regular mathematical programming problems
- Penalty function method and regularization in the analysis of improper convex programs
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- scientific article; zbMATH DE number 1419391
- A regularized penalty method for solving convex semi-infinite programs
- scientific article; zbMATH DE number 5300280
- scientific article; zbMATH DE number 56708
Cites work
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- A new extreme point algorithm and its application in PSQP algorithms for solving mathematical programs with linear complementarity constraints.
- A smoothing method for mathematical programs with equilibrium constraints
- An implementable active-set algorithm for computing a B-stationary point of a mathematical program with linear complementarity constraints
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- Extension of quasi-Newton methods to mathematical programs with complementarity con\-straints
- First and second-order necessary and sufficient optimality conditions for infinite-dimensional programming problems
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- OPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
Cited in
(50)- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Computational approaches for mixed integer optimal control problems with indicator constraints
- A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Solving bilevel programs with the KKT-approach
- Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
- Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks
- Two new weak constraint qualifications for mathematical programs with equilibrium constraints and applications
- On properties of the bilinear penalty function method for mathematical programs with semidefinite cone complementarity constraints
- Smoothing and regularization strategies for optimization of hybrid dynamic systems
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- Basic theoretical foundations and insights on bilevel models and their applications to power systems
- Structural properties of affine sparsity constraints
- Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
- A general MPCC model and its solution algorithm for continuous network design problem
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
- Relaxation approach for equilibrium problems with equilibrium constraints
- Critical sets in one-parametric mathematical programs with complementarity constraints
- scientific article; zbMATH DE number 1306979 (Why is no real title available?)
- Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
- An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities
- 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
- MPEC methods for bilevel optimization problems
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
- A penalty method and a regularization strategy to solve MPCC
- MPCC strategies for nonsmooth nonlinear programs
- One-parametric schemes for solving mathematical programs with complementarity constraints: theoretical properties
- Pathfollowing for parametric mathematical programs with complementarity constraints
- Finite elements with switch detection for direct optimal control of nonsmooth systems
- Relaxation approaches for nonlinear sparse optimization problems
- Lifting mathematical programs with complementarity constraints
- Finite elements with switch detection for numerical optimal control of nonsmooth dynamical systems with set-valued heaviside step functions
- An exact penalty approach for general ℓ 0 -sparse optimization problems
- Solving mathematical programs with complementarity constraints arising in nonsmooth optimal control
- LCQPow: a solver for linear complementarity quadratic programs
- Triggering a variety of Nash-equilibria in oligopolistic electricity markets
- Combining the regularization strategy and the SQP to solve MPCC -- a MATLAB implementation
- Comparing one-parametric schemes for solving mathematical programs with complementarity constraints: limit points, continuation and numerical experiences
- Efficiently solving linear bilevel programming problems using off-the-shelf optimization software
- A Lasry-Lions envelope approach for mathematical programs with complementarity constraints
- Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints
- A globally convergent algorithm for MPCC
- A link-node discrete-time dynamic second best toll pricing model with a relaxation solution algorithm
- Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties
- Solving stochastic transportation network protection problems using the progressive hedging-based method
- Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints
- Stochastic programming approach to optimization under uncertainty
This page was built for publication: Some properties of regularization and penalization schemes for MPECs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657706)
