A non-interior continuation method for generalized linear complementarity problems
From MaRDI portal
Publication:1968796
Recommendations
- One-step quadratic convergence of noninterior continuation method for NCP
- A non-interior continuation algorithm for the CP based on a generalized smoothing function
- The global linear and local quadratic convergence of a non-interior continuation algorithm for the LCP
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity.
Cited in
(46)- Generalized multilinear games and vertical tensor complementarity problems
- On almost smooth functions and piecewise smooth functions
- A modulus-based formulation for the vertical linear complementarity problem
- A smoothing method for solving portfolio optimization with CVaR and applications in allocation of generation asset
- A nonsmooth Levenberg-Marquardt method for vertical complementarity problems
- Global error bounds for the extended vertical LCP
- Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems
- A smoothing SQP method for nonlinear programs with stability constraints arising from power systems
- An adaptive smoothing method for continuous minimax problems
- Recursive approximation of the high dimensional max function
- A modulus-based matrix splitting method for the vertical nonlinear complementarity problem
- Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity.
- Flattened aggregate function method for nonlinear programming with many complicated constraints
- A smoothing algorithm for a new two-stage stochastic model of supply chain based on sample average approximation
- Truncated aggregate homotopy method for nonconvex nonlinear programming
- Generalized modulus-based matrix splitting algorithm with Anderson acceleration strategy for vertical linear complementarity problems
- Existence results of solutions to a generalized vertical polynomial complementarity problem in terms of vertical block tensor tuples
- Projected fixed-point method for vertical tensor complementarity problems
- Global convergence of a smooth approximation method for mathematical programs with complementarity constraints
- A generalized complementarity approach to solving real option problems
- The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
- Existence of the least element solution of the vertical block \(Z\)-tensor complementarity problem
- A truncated aggregate smoothing Newton method for minimax problems
- Generalized Linear Complementarity Problems
- A smoothing SAA method for a stochastic mathematical program with complementarity constraints.
- A two-step new modulus-based matrix splitting method for vertical linear complementarity problem
- Smooth convex approximation to the maximum eigenvalue function
- scientific article; zbMATH DE number 2075805 (Why is no real title available?)
- New multiplier method for solving linear complementarity problems
- Scalable relaxation two-sweep modulus-based matrix splitting methods for vertical LCP
- A smoothing SAA algorithm for a portfolio choice model based on second-order stochastic dominance measures
- Error bounds of two smoothing approximations for semi-infinite minimax problems
- A sample average approximation regularization method for a stochastic mathematical program with general vertical complementarity constraints
- Inexact smoothing method for large scale minimax optimization
- An aggregate deformation homotopy method for min-max-min problems with max-min constraints
- On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems
- Global linear and quadratic one-step smoothing Newton method for vertical linear complementarity problems
- A network of options: evaluating complex interdependent decisions under uncertainty
- A SAA nonlinear regularization method for a stochastic extended vertical linear complementarity problem
- Projected splitting methods for vertical linear complementarity problems
- A smoothing three-term conjugate gradient method for solving finite minimax problems
- A non-interior continuation algorithm for the CP based on a generalized smoothing function
- A smoothing iterative method for the finite minimax problem
- Regularity and stability of feedback relaxed controls
- Relaxation modulus-based matrix splitting iteration method for vertical linear complementarity problem
This page was built for publication: A non-interior continuation method for generalized linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1968796)
