A smoothing method for mathematical programs with equilibrium constraints
From MaRDI portal
Publication:1295960
DOI10.1007/S101070050048zbMATH Open0959.65079OpenAlexW4246495354MaRDI QIDQ1295960FDOQ1295960
Liqun Qi, Houyuan Jiang, Francisco Facchinei
Publication date: 28 June 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050048
Recommendations
- A new smoothing technique for mathematical programs with equilibrium constraints
- scientific article
- A note on smoothing mathematical programs with equilibrium constraints
- Convergence of an Inexact Smoothing Method for Mathematical Programs with Equilibrium Constraints
- A smoothing method for mathematical programs with complementarity constraints
- A class of smoothing methods for mathematical programs with complementarity constraints
- A new smoothing method for mathematical programs with complementarity constraints
- Smoothing method for mathematical programs with symmetric cone complementarity constraints
- Mathematical Programs with Complementarity Constraints: Convergence Properties of a Smoothing Method
- Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints
algorithmglobal convergenceequilibrium constraintsoptimality conditionsvariational inequality problemsstrong monotonicitysmoothing method
Cited In (only showing first 100 items - show all)
- Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints
- Electricity swing option pricing by stochastic bilevel optimization: a survey and new approaches
- Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
- A smoothing approach for solving transportation problem with road toll pricing and capacity expansions
- On the Guignard constraint qualification for mathematical programs with equilibrium constraints
- On the global minimization of the value-at-risk
- A pivoting algorithm for linear programming with linear complementarity constraints
- An approximate programming method based on the simplex method for bilevel programming problem
- Solving quadratic convex bilevel programming problems using a smoothing method
- Active set algorithm for mathematical programs with linear complementarity constraints
- On the convergence of general regularization and smoothing schemes for mathematical programs with complementarity constraints
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
- A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints
- An inexact-restoration method for nonlinear bilevel programming problems
- A continuation method for (strongly) monotone variational inequalities
- Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints
- Exact penalty functions for convex bilevel programming problems.
- Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
- Identification of cohesive crack fracture parameters by evolutionary search.
- Inverse coefficient problems for variational inequalities: Optimality conditions and numerical realization
- A neural network approach for solving nonlinear bilevel programming problem
- A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- A log-exponential smoothing method for mathematical programs with complementarity constraints
- Optimization problems with equilibrium constraints and their numerical solution.
- Lower-order penalty methods for mathematical programs with complementarity constraints
- Hybrid approach with active set identification for mathematical programs with complementarity constraints
- Global convergence of a smooth approximation method for mathematical programs with complementarity constraints
- On structural safety assessment by load factor maximization in piecewise linear plasticity
- Gradient consistency for integral-convolution smoothing functions
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- Parameter identification of quasibrittle materials as a mathematical program with equilibrium constraints
- A modified relaxation scheme for mathematical programs with complementarity constraints
- A robust signal control system for equilibrium flow under uncertain travel demand and traffic delay
- A smoothing function approach to joint chance-constrained programs
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Solving bilevel programs with the KKT-approach
- Feasible method for generalized semi-infinite programming
- Some properties of regularization and penalization schemes for MPECs
- On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints
- Neural network for solving convex quadratic bilevel programming problems
- A smoothing heuristic for a bilevel pricing problem
- Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization
- An overview of bilevel optimization
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- Partial augmented Lagrangian method and mathematical programs with complementarity constraints
- Convergence properties of a smoothing approach for mathematical programs with second-order cone complementarity constraints
- Convergence of a continuous approach for zero-one programming problems
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
- An entropic regularization approach for mathematical programs with equilibrium constraints
- BOLIB: Bilevel Optimization LIBrary of Test Problems
- An MPCC approach for stochastic Stackelberg–Nash–Cournot equilibrium
- A new smoothing scheme for mathematical programs with complementarity constraints
- A class of smoothing methods for mathematical programs with complementarity constraints
- A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
- A neural network for solving a convex quadratic bilevel programming problem
- A perturbation approach for a type of inverse linear programming problems
- A smoothing method for solving bilevel multiobjective programming problems
- Stochastic mathematical programs with equilibrium constraints
- An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities
- Computing equilibria in economies with incomplete markets, collateral and default penalties
- A perturbation approach for an inverse quadratic programming problem
- Smoothing approach to Nash equilibrium formulations for a class of equilibrium problems with shared complementarity constraints
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
- New relaxation method for mathematical programs with complementarity constraints
- Smoothing method for mathematical programs with symmetric cone complementarity constraints
- How to solve a semi-infinite optimization problem
- A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Algorithms for linear programming with linear complementarity constraints
- On stochastic gradient and subgradient methods with adaptive steplength sequences
- Characterization of strong stability for C-stationary points in MPCC
- A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints
- Recursive approximation of the high dimensional max function
- A robust SQP method for mathematical programs with linear complementarity constraints
- A practical optimality condition without constraint qualifications for nonlinear programming
- Topology optimization of structures in unilateral contact
- Topology optimization of structures with manufacturing and unilateral contact constraints by minimizing an adjustable compliance-volume product
- Solving mathematical programs with complementarity constraints as nonlinear programs
- Smoothing methods for nonsmooth, nonconvex minimization
- A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
- A Global Optimization Approach for Multimarginal Optimal Transport Problems with Coulomb Cost
- Improved Convergence Properties of the Relaxation Schemes of Kadrani et al. and Kanzow and Schwartz for MPEC
- An efficient solution strategy for bilevel multiobjective optimization problems using multiobjective evolutionary algorithm
- Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints
- Homotopy method for solving mathematical programs with bounded box-constrained variational inequalities
- Title not available (Why is that?)
- Single-level reformulations of a specific non-smooth bilevel programming problem and their applications
- Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints
- A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints
- A new smoothing technique for mathematical programs with equilibrium constraints
- An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems
- A class of mathematical programs with equilibrium constraints: a smooth algorithm and applications to contact problems
- On solving difference of convex functions programs with linear complementarity constraints
- A generalized project metric algorithm for mathematical programs with equilibrium constraints
- Mathematical Programs with Equilibrium Constraints: A Brief Survey of Methods and Optimality Conditions
- A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints
- MPCC strategies for nonsmooth nonlinear programs
- A globally convergent neurodynamics optimization model for mathematical programming with equilibrium constraints
- Computational approaches for mixed integer optimal control problems with indicator constraints
This page was built for publication: A smoothing 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 Q1295960)
