A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints

From MaRDI portal
Revision as of 21:48, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3083298

DOI10.1137/090748883zbMath1231.90350OpenAlexW2069531980MaRDI QIDQ3083298

Sonja Steffensen, Michael Ulbrich

Publication date: 21 March 2011

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090748883




Related Items (36)

An SOS1-based approach for solving MPECs with a natural gas market applicationConvergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraintsA study of one-parameter regularization methods for mathematical programs with vanishing constraintsSolving quadratic multi-leader-follower games by smoothing the follower's best responseMathematical programs with vanishing constraints: a new regularization approach with strong convergence propertiesConvergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimizationEnhanced models and improved solution for competitive biofuel supply chain design under land use constraintsRelaxation approach for equilibrium problems with equilibrium constraintsEfficient automated schematic map drawing using multiobjective mixed integer programmingA relaxed constant positive linear dependence constraint qualification for mathematical programs with equilibrium constraintsSecond-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problemsMPCC strategies for nonsmooth nonlinear programsFirst- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank conditionOptimal control of quasistatic plasticity with linear kinematic hardening II: regularization and differentiabilityOn approximate stationary points of the regularized mathematical program with complementarity constraintsNew constraint qualifications for mathematical programs with second-order cone complementarity constraintsTheoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraintsOn solving difference of convex functions programs with linear complementarity constraintsMathematical programs with vanishing constraints: critical point theoryAn Approximation Scheme for Distributionally Robust Nonlinear OptimizationUnnamed ItemA new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential functionConstraint qualifications for mathematical programs with equilibrium constraints and their local preservation propertyA superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraintsA comparison of solution approaches for the numerical treatment of or-constrained optimization problemsMathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization MethodTwo new weak constraint qualifications for mathematical programs with equilibrium constraints and applicationsConvergence Properties of a Second Order Augmented Lagrangian Method for Mathematical Programs with Complementarity ConstraintsSequential optimality conditions for cardinality-constrained optimization problems with applicationsConvergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraintsBilevel programming for price-based electricity auctions: a revenue-constrained caseOn linear problems with complementarity constraintsA LOCALLY SMOOTHING METHOD FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTSThe Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints RevisitedNewton Hard-Thresholding Pursuit for Sparse Linear Complementarity Problem via A New Merit FunctionRelaxation schemes for mathematical programmes with switching constraints


Uses Software



This page was built for publication: A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints