Pages that link to "Item:Q1968796"

The following pages link to A non-interior continuation method for generalized linear complementarity problems (Q1968796):

Displaying 46 items.

• Inexact smoothing method for large scale minimax optimization (Q425468) (← links)
• A smoothing SQP method for nonlinear programs with stability constraints arising from power systems (Q434161) (← links)
• A sample average approximation regularization method for a stochastic mathematical program with general vertical complementarity constraints (Q484867) (← links)
• Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems (Q582015) (← links)
• An aggregate deformation homotopy method for min-max-min problems with max-min constraints (Q616792) (← links)
• A non-interior continuation algorithm for the CP based on a generalized smoothing function (Q629488) (← links)
• Global error bounds for the extended vertical LCP (Q632384) (← links)
• A network of options: evaluating complex interdependent decisions under uncertainty (Q633325) (← links)
• New multiplier method for solving linear complementarity problems (Q719949) (← links)
• On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems (Q811890) (← links)
• A generalized complementarity approach to solving real option problems (Q844678) (← links)
• Global convergence of a smooth approximation method for mathematical programs with complementarity constraints (Q857941) (← links)
• On almost smooth functions and piecewise smooth functions (Q881610) (← links)
• An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems (Q939107) (← links)
• A smoothing method for solving portfolio optimization with CVaR and applications in allocation of generation asset (Q979251) (← links)
• A truncated aggregate smoothing Newton method for minimax problems (Q979271) (← links)
• Error bounds of two smoothing approximations for semi-infinite minimax problems (Q1048250) (← links)
• A SAA nonlinear regularization method for a stochastic extended vertical linear complementarity problem (Q1646189) (← links)
• A nonsmooth Levenberg-Marquardt method for vertical complementarity problems (Q1678591) (← links)
• Smooth convex approximation to the maximum eigenvalue function (Q1777442) (← links)
• Global linear and quadratic one-step smoothing Newton method for vertical linear complementarity problems (Q1888919) (← links)
• A smoothing SAA method for a stochastic mathematical program with complementarity constraints. (Q1928176) (← links)
• A smoothing algorithm for a new two-stage stochastic model of supply chain based on sample average approximation (Q1992874) (← links)
• Projected splitting methods for vertical linear complementarity problems (Q2139273) (← links)
• A modulus-based formulation for the vertical linear complementarity problem (Q2159423) (← links)
• A smoothing SAA algorithm for a portfolio choice model based on second-order stochastic dominance measures (Q2190257) (← links)
• Flattened aggregate function method for nonlinear programming with many complicated constraints (Q2219438) (← links)
• A smoothing iterative method for the finite minimax problem (Q2306388) (← links)
• The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints (Q2423272) (← links)
• Recursive approximation of the high dimensional max function (Q2488194) (← links)
• Regularity and Stability of Feedback Relaxed Controls (Q3382776) (← links)
• (Q4470848) (← links)
• Generalized Linear Complementarity Problems (Q4848423) (← links)
• An Adaptive Smoothing Method for Continuous Minimax Problems (Q5245835) (← links)
• Truncated aggregate homotopy method for nonconvex nonlinear programming (Q5746690) (← links)
• Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity. (Q5929417) (← links)
• A modulus-based matrix splitting method for the vertical nonlinear complementarity problem (Q6046867) (← links)
• Relaxation modulus-based matrix splitting iteration method for vertical linear complementarity problem (Q6073134) (← links)
• Generalized multilinear games and vertical tensor complementarity problems (Q6150642) (← links)
• Existence of the least element solution of the vertical block \(Z\)-tensor complementarity problem (Q6164965) (← links)
• Generalized modulus-based matrix splitting algorithm with Anderson acceleration strategy for vertical linear complementarity problems (Q6489273) (← links)
• Existence results of solutions to a generalized vertical polynomial complementarity problem in terms of vertical block tensor tuples (Q6582071) (← links)
• A two-step new modulus-based matrix splitting method for vertical linear complementarity problem (Q6586917) (← links)
• Projected fixed-point method for vertical tensor complementarity problems (Q6606855) (← links)
• Scalable relaxation two-sweep modulus-based matrix splitting methods for vertical LCP (Q6636808) (← links)
• A smoothing three-term conjugate gradient method for solving finite minimax problems (Q6665161) (← links)