A Non-Interior-Point Continuation Method for Linear Complementarity Problems
From MaRDI portal
Publication:3142623
DOI10.1137/0614081zbMath0788.65073OpenAlexW2065691568MaRDI QIDQ3142623
Bintong Chen, Patrick T. Harker
Publication date: 6 June 1994
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0614081
interior-point algorithmscontinuation methodLemke's algorithmlinear complementary problemcomputational testspolynomial path following algorithm
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems, Semi-smooth Newton methods for nonlinear complementarity formulation of compositional two-phase flow in porous media, Smooth formulation for isothermal compositional simulation with improved nonlinear convergence, A regularized smoothing Newton-type algorithm for quasi-variational inequalities, A pathsearch damped Newton method for computing general equilibria, A global linear and local superlinear (quadratic) inexact non-interior continuation method for variational inequalities over general closed convex sets, On bilevel programs with a convex lower-level problem violating Slater's constraint qualification, An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions, A fixed-point method for a class of super-large scale nonlinear complementarity problems, Smoothing Newton method for generalized complementarity problems based on a new smoothing function, Analysis of a smoothing method for symmetric conic linear programming, A continuation method for monotone variational inequalities, Analysis on the smoothing method for the \(P\)-linear complementarity systems, A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps, Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms, An infeasible-start path-following method for monotone LCPs, A new approach to continuation methods for complementarity problems with uniform \(P\)-functions, A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem, A class of smoothing methods for mathematical programs with complementarity constraints, On almost smooth functions and piecewise smooth functions, An \((m+1)\)-step iterative method of convergence order \((m+2)\) for linear complementarity problems. An \((m+1)\)-step iterative method for LCPs, A novel non-linear approach to minimal area rectangular packing, Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity, An Error Analysis of a Finite Element Method with IMEX-Time Semidiscretizations for Some Partial Integro-differential Inequalities Arising in the Pricing of American Options, MPCC strategies for nonsmooth nonlinear programs, A cosh-based smoothing Newton method for \(P_{0}\) nonlinear complementarity problem, A smoothing Levenberg-Marquardt algorithm for solving a class of stochastic linear complementarity problem, A full-Newton step non-interior continuation algorithm for a class of complementarity problems, Solvability of monotone tensor complementarity problems, Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity., Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions, A smoothing inexact Newton method for \(P_0\) nonlinear complementarity problem, Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function, The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function, A class of smoothing SAA methods for a stochastic mathematical program with complementarity constraints, A Newton-type algorithm for the tensor eigenvalue complementarity problem and some applications, On lifting operators and regularity of nonsmooth Newton methods for optimal control problems of differential algebraic equations, On convergence of a smoothing Broyden-like method for \(P_0\)-NCP, Smoothing method for mathematical programs with symmetric cone complementarity constraints, Gradient consistency for integral-convolution smoothing functions, Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems, On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities, Convergence analysis of a smoothing SAA method for a stochastic mathematical program with second-order cone complementarity constraints, A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints, Extension of smoothing functions to symmetric cone complementarity problems, A smoothing Newton's method for the construction of a damped vibrating system from noisy test eigendata, Inverse semidefinite quadratic programming problem with \(l_1\) norm measure, Formulating an \(n\)-person noncooperative game as a tensor complementarity problem, A family of new smoothing functions and~a~nonmonotone smoothing Newton method for the nonlinear complementarity problems, A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs, A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties, Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity., Verification for existence of solutions of linear complementarity problems, A continuation method for linear complementarity problems withP0matrix, A smoothing Levenberg-Marquardt method for the extended linear complementarity problem, A globally and superlinearly convergent smoothing Broyden-like method for solving nonlinear complementarity problem, The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function, Smoothing algorithms for complementarity problems over symmetric cones, Some non-interior path-following methods based on a scaled central path for linear complementarity problems, Smoothing functions and smoothing Newton method for complementarity and variational inequality problems, Solving variational inequality problems via smoothing-nonsmooth reformulations, Predictor-corrector smoothing methods for monotone LCP, Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem, A new smoothing and regularization Newton method for \(P_{0}\)-NCP, A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search, Smoothing methods for nonsmooth, nonconvex minimization, A smoothing Newton method for ncps with the \(P_{0}\)-property, Tensor complementarity problems. II: Solution methods, New multiplier method for solving linear complementarity problems, A matrix-free smoothing algorithm for large-scale support vector machines, A smoothing Levenberg-Marquardt method for NCP, Complexity of a noninterior path-following method for the linear complementarity problem, Convergence of a non-interior smoothing method for variational inequality problems, A smoothing and regularization Broyden-like method for nonlinear inequalities, Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems, A new one-step smoothing newton method for the second-order cone complementarity problem, Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects, A variant smoothing Newton method for \(P_0\)-\(NCP\) based on a new smoothing function, Improving the convergence of non-interior point algorithms for nonlinear complementarity problems, A smoothing homotopy method for solving variational inequalities, Smoothing Newton method for nonsmooth second-order cone complementarity problems with application to electric power markets, General six-step discrete-time Zhang neural network for time-varying tensor absolute value equations, Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines, On finite termination of an iterative method for linear complementarity problems, A class of smoothing functions for nonlinear and mixed complementarity problems, A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution, A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones, A continuation method for (strongly) monotone variational inequalities, A smoothing least square method for nonlinear complementarity problem, A new homotopy method for solving non-linear complementarity problems, The convex and monotone functions associated with second-order cone, A new noninterior continuation method for solving a system of equalities and inequalities, A smoothing Newton method preserving nonnegativity for solving tensor complementarity problems with \(P_0\) mappings, Superlinear/quadratic one-step smoothing Newton method for \(P_0\)-NCP, An interior point parameterized central path following algorithm for linearly constrained convex programming, A new smoothing quasi-Newton method for nonlinear complementarity problems, A smoothing Broyden-like method for the mixed complementarity problems, The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem, Continuation method for nonlinear complementarity problems via normal maps, A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints
Uses Software
