Pages that link to "Item:Q1295960"

The following pages link to A smoothing method for mathematical programs with equilibrium constraints (Q1295960):

Displaying 50 items.

• A smoothing approach for solving transportation problem with road toll pricing and capacity expansions (Q260202) (← links)
• Solving disjunctive optimization problems by generalized semi-infinite optimization techniques (Q301738) (← links)
• Computing equilibria in economies with incomplete markets, collateral and default penalties (Q363584) (← links)
• Topology optimization of structures in unilateral contact (Q381412) (← links)
• Topology optimization of structures with manufacturing and unilateral contact constraints by minimizing an adjustable compliance-volume product (Q381516) (← links)
• A log-exponential smoothing method for mathematical programs with complementarity constraints (Q434603) (← links)
• On stochastic gradient and subgradient methods with adaptive steplength sequences (Q445032) (← links)
• Smoothing approach to Nash equilibrium formulations for a class of equilibrium problems with shared complementarity constraints (Q453608) (← links)
• A smoothing function approach to joint chance-constrained programs (Q467479) (← links)
• Neural network for solving convex quadratic bilevel programming problems (Q470205) (← links)
• A smoothing method for solving bilevel multiobjective programming problems (Q489158) (← links)
• Gradient consistency for integral-convolution smoothing functions (Q491234) (← links)
• An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities (Q494664) (← links)
• Active set algorithm for mathematical programs with linear complementarity constraints (Q545973) (← links)
• An approximate programming method based on the simplex method for bilevel programming problem (Q604030) (← links)
• Feasible method for generalized semi-infinite programming (Q604267) (← links)
• Smoothing mathematical programmes with equilibrium constraints via neural network function (Q604774) (← links)
• A perturbation approach for an inverse quadratic programming problem (Q607673) (← links)
• Convergence of a continuous approach for zero-one programming problems (Q621018) (← links)
• A new smoothing scheme for mathematical programs with complementarity constraints (Q625758) (← links)
• Solving quadratic convex bilevel programming problems using a smoothing method (Q632921) (← links)
• A smoothing Newton method for mathematical programs constrained by parameterized quasi-variational inequalities (Q657283) (← links)
• Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints (Q683732) (← links)
• A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints (Q697548) (← links)
• Optimization problems with equilibrium constraints and their numerical solution. (Q703216) (← links)
• A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints (Q704808) (← links)
• Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← 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)
• A smoothing Newton-type method for solving the \(L _{2}\) spectral estimation problem with lower and upper bounds (Q763390) (← links)
• A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints (Q812423) (← links)
• A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints (Q816061) (← links)
• An inexact-restoration method for nonlinear bilevel programming problems (Q839690) (← links)
• A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints (Q857798) (← links)
• Global convergence of a smooth approximation method for mathematical programs with complementarity constraints (Q857941) (← links)
• A class of smoothing methods for mathematical programs with complementarity constraints (Q878902) (← links)
• A new smoothing technique for mathematical programs with equilibrium constraints (Q940447) (← links)
• A neural network approach for solving nonlinear bilevel programming problem (Q945185) (← links)
• On structural safety assessment by load factor maximization in piecewise linear plasticity (Q950444) (← links)
• Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization (Q959946) (← links)
• A neural network for solving a convex quadratic bilevel programming problem (Q964970) (← links)
• Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints (Q983712) (← links)
• A continuation method for (strongly) monotone variational inequalities (Q1290602) (← links)
• New relaxation method for mathematical programs with complementarity constraints (Q1407237) (← links)
• A practical optimality condition without constraint qualifications for nonlinear programming (Q1407238) (← links)
• Computational approaches for mixed integer optimal control problems with indicator constraints (Q1633792) (← links)
• A bridge between bilevel programs and Nash games (Q1673905) (← links)
• Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems (Q1683936) (← links)
• An interior point method for nonlinear optimization with a quasi-tangential subproblem (Q1689438) (← links)