Pages that link to "Item:Q2784433"

The following pages link to An implementable active-set algorithm for computing a B-stationary point of a mathematical program with linear complementarity constraints (Q2784433):

Displaying 50 items.

• Feasibility problems with complementarity constraints (Q320869) (← links)
• Feature selection and multi-kernel learning for sparse representation on a manifold (Q470203) (← links)
• Minimal zero norm solutions of linear complementarity problems (Q481048) (← links)
• An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities (Q494664) (← links)
• A half thresholding projection algorithm for sparse solutions of LCPs (Q497459) (← links)
• Active set algorithm for mathematical programs with linear complementarity constraints (Q545973) (← links)
• Three modeling paradigms in mathematical programming (Q607499) (← links)
• Lifting mathematical programs with complementarity constraints (Q662308) (← links)
• A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints (Q704808) (← links)
• A globally convergent algorithm for MPCC (Q748600) (← links)
• A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints (Q812423) (← links)
• A class of quadratic programs with linear complementarity constraints (Q833022) (← links)
• Global convergence of a smooth approximation method for mathematical programs with complementarity constraints (Q857941) (← links)
• Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties (Q879968) (← links)
• Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints (Q983712) (← links)
• Convergence analysis of an augmented Lagrangian method for mathematical programs with complementarity constraints (Q1000036) (← links)
• A trust region algorithm for nonlinear bilevel programming (Q1604045) (← links)
• Locality preserving score for joint feature weights learning (Q1669154) (← links)
• Algorithms for linear programming with linear complementarity constraints (Q1935876) (← links)
• A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations (Q1941032) (← links)
• Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method (Q2105287) (← links)
• Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation (Q2220667) (← links)
• Extragradient thresholding methods for sparse solutions of co-coercive ncps (Q2260937) (← links)
• On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints (Q2269590) (← links)
• Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
• A generalized project metric algorithm for mathematical programs with equilibrium constraints (Q2349543) (← links)
• Tikhonov regularization for mathematical programs with generalized complementarity constraints (Q2354478) (← links)
• Homotopy method for a class of multiobjective optimization problems with equilibrium constraints (Q2358471) (← links)
• Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs (Q2465653) (← links)
• Complementarity active-set algorithm for mathematical programming problems with equilibrium constraints (Q2471112) (← links)
• Newton-type method for a class of mathematical programs with complementarity constraints (Q2477225) (← links)
• Merit-function piecewise SQP algorithm for mathematical programs with equilibrium constraints (Q2483036) (← 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)
• A robust SQP method for mathematical programs with linear complementarity constraints (Q2506190) (← links)
• Dynamic programming approach to discrete time dynamic feedback Stackelberg games with independent and dependent followers (Q2569119) (← links)
• Dynamic Stackelberg games under open-loop complete information (Q2571787) (← links)
• Globally convergent primal-dual active-set methods with inexact subproblem solves (Q2832889) (← links)
• A pivoting algorithm for linear programming with linear complementarity constraints (Q2885465) (← links)
• Potential impact of recharging plug-in hybrid electric vehicles on locational marginal prices (Q3065631) (← links)
• Critical sets in one-parametric mathematical programs with complementarity constraints (Q3498595) (← links)
• On the Guignard constraint qualification for mathematical programs with equilibrium constraints (Q3534641) (← links)
• Some properties of regularization and penalization schemes for MPECs (Q4657706) (← links)
• On the global minimization of the value-at-risk (Q4657710) (← links)
• Reformulation of the M-Stationarity Conditions as a System of Discontinuous Equations and Its Solution by a Semismooth Newton Method (Q4997170) (← links)
• MPEC Methods for Bilevel Optimization Problems (Q5014634) (← links)
• Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints (Q5026840) (← links)
• Finite convergence of an active signature method to local minima of piecewise linear functions (Q5198051) (← links)
• A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints (Q5290836) (← links)
• Lower-order penalty methods for mathematical programs with complementarity constraints (Q5460657) (← links)