A non-interior continuation method for generalized linear complementarity problems
From MaRDI portal
Publication:1968796
DOI10.1007/s101070050104zbMath0987.90081OpenAlexW2027214318MaRDI QIDQ1968796
Publication date: 17 June 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050104
generalized linear complementarity problemnoninterior continuation method\(Q\)-quadratical convergence
Related Items
Global linear and quadratic one-step smoothing Newton method for vertical linear complementarity problems ⋮ Projected splitting methods for vertical linear complementarity problems ⋮ A generalized complementarity approach to solving real option problems ⋮ A SAA nonlinear regularization method for a stochastic extended vertical linear complementarity problem ⋮ Global convergence of a smooth approximation method for mathematical programs with complementarity constraints ⋮ A modulus-based formulation for the vertical linear complementarity problem ⋮ On almost smooth functions and piecewise smooth functions ⋮ A nonsmooth Levenberg-Marquardt method for vertical complementarity problems ⋮ A smoothing SAA method for a stochastic mathematical program with complementarity constraints. ⋮ An aggregate deformation homotopy method for min-max-min problems with max-min constraints ⋮ A modulus-based matrix splitting method for the vertical nonlinear complementarity problem ⋮ Relaxation modulus-based matrix splitting iteration method for vertical linear complementarity problem ⋮ A smoothing SAA algorithm for a portfolio choice model based on second-order stochastic dominance measures ⋮ The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints ⋮ Generalized multilinear games and vertical tensor complementarity problems ⋮ Existence of the least element solution of the vertical block \(Z\)-tensor complementarity problem ⋮ Inexact smoothing method for large scale minimax optimization ⋮ Global error bounds for the extended vertical LCP ⋮ A network of options: evaluating complex interdependent decisions under uncertainty ⋮ A smoothing SQP method for nonlinear programs with stability constraints arising from power systems ⋮ Flattened aggregate function method for nonlinear programming with many complicated constraints ⋮ A sample average approximation regularization method for a stochastic mathematical program with general vertical complementarity constraints ⋮ An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems ⋮ A smoothing algorithm for a new two-stage stochastic model of supply chain based on sample average approximation ⋮ Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity. ⋮ Recursive approximation of the high dimensional max function ⋮ Truncated aggregate homotopy method for nonconvex nonlinear programming ⋮ A smoothing method for solving portfolio optimization with CVaR and applications in allocation of generation asset ⋮ A truncated aggregate smoothing Newton method for minimax problems ⋮ Smooth convex approximation to the maximum eigenvalue function ⋮ New multiplier method for solving linear complementarity problems ⋮ Regularity and Stability of Feedback Relaxed Controls ⋮ A smoothing iterative method for the finite minimax problem ⋮ An Adaptive Smoothing Method for Continuous Minimax Problems ⋮ Error bounds of two smoothing approximations for semi-infinite minimax problems ⋮ On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems
