Pages that link to "Item:Q1772964"
From MaRDI portal
The following pages link to A modified relaxation scheme for mathematical programs with complementarity constraints (Q1772964):
Displaying 47 items.
- A smoothing approach for solving transportation problem with road toll pricing and capacity expansions (Q260202) (← links)
- Second-order optimality conditions for mathematical programs with equilibrium constraints (Q368596) (← links)
- A note on the sample average approximation method for stochastic mathematical programs with complementarity constraints (Q432385) (← links)
- An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities (Q494664) (← links)
- Feasible method for generalized semi-infinite programming (Q604267) (← links)
- A perturbation approach for an inverse quadratic programming problem (Q607673) (← links)
- A new smoothing scheme for mathematical programs with complementarity constraints (Q625758) (← links)
- A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints (Q668747) (← links)
- Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints (Q683732) (← links)
- Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints (Q742306) (← links)
- A globally convergent algorithm for MPCC (Q748600) (← links)
- Convergence properties of a smoothing approach for mathematical programs with second-order cone complementarity constraints (Q763335) (← links)
- Application of general semi-infinite programming to lapidary cutting problems (Q932204) (← links)
- Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization (Q959946) (← links)
- Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints (Q983712) (← links)
- Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization (Q1639718) (← links)
- Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems (Q1683936) (← links)
- On the convergence properties of a smoothing approach for mathematical programs with symmetric cone complementarity constraints (Q1717009) (← links)
- A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function (Q1721022) (← links)
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators (Q1730476) (← links)
- A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations (Q1941032) (← links)
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints (Q1942257) (← links)
- On linear problems with complementarity constraints (Q2080820) (← links)
- On approximate stationary points of the regularized mathematical program with complementarity constraints (Q2194126) (← links)
- Planning tank-truck hazardous materials shipments in intercity road transportation networks (Q2245875) (← links)
- A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints (Q2353465) (← links)
- A perturbation-based approach for continuous network design problem with emissions (Q2353468) (← links)
- Tikhonov regularization for mathematical programs with generalized complementarity constraints (Q2354478) (← links)
- The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints (Q2423272) (← links)
- A majorized penalty approach to inverse linear second order cone programming problems (Q2438414) (← links)
- Hybrid approach with active set identification for mathematical programs with complementarity constraints (Q2499368) (← links)
- Partial augmented Lagrangian method and mathematical programs with complementarity constraints (Q2501113) (← links)
- Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties (Q2903144) (← links)
- Smoothing method for mathematical programs with symmetric cone complementarity constraints (Q2996793) (← links)
- CONVERGENCE ANALYSIS OF A REGULARIZED SAMPLE AVERAGE APPROXIMATION METHOD FOR STOCHASTIC MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS (Q3114613) (← links)
- Improved Convergence Properties of the Relaxation Schemes of Kadrani <i>et al.</i> and Kanzow and Schwartz for MPEC (Q4604922) (← links)
- Convergence Properties of a Second Order Augmented Lagrangian Method for Mathematical Programs with Complementarity Constraints (Q4687232) (← links)
- A LOCALLY SMOOTHING METHOD FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS (Q5252111) (← links)
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited (Q5252220) (← links)
- A perturbation approach for a type of inverse linear programming problems (Q5391505) (← links)
- New restricted NCP functions and their applications to stochastic NCP and stochastic MPEC (Q5426966) (← links)
- New reformulations for stochastic nonlinear complementarity problems (Q5481684) (← links)
- MPCC strategies for nonsmooth nonlinear programs (Q6050379) (← links)
- Approximate Karush-Kuhn-Tucker condition for multi-objective optimistic bilevel programming problems (Q6086968) (← links)
- A Global Optimization Approach for Multimarginal Optimal Transport Problems with Coulomb Cost (Q6098523) (← links)
- New constraint qualifications for mathematical programs with second-order cone complementarity constraints (Q6145063) (← links)
- On solving difference of convex functions programs with linear complementarity constraints (Q6166653) (← links)