A Non-Interior-Point Continuation Method for Linear Complementarity Problems
From MaRDI portal
Recommendations
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- A General Framework of Continuation Methods for Complementarity Problems
- A continuation method for linear complementarity problems with \({P}_{0}\) matrix
- The global linear and local quadratic convergence of a non-interior continuation algorithm for the LCP
- scientific article; zbMATH DE number 1855674
Cited in
(only showing first 100 items - show all)- A variant smoothing Newton method for P₀-NCP based on a new smoothing function
- 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 new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point
- A new approach to continuation methods for complementarity problems with uniform P-functions
- Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity.
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
- Identification of the optimal active set in a noninterior continuation method for LCP
- The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem
- Continuation method for nonlinear complementarity problems via normal maps
- On bilevel programs with a convex lower-level problem violating Slater's constraint qualification
- Smoothing Newton method for generalized complementarity problems based on a new smoothing function
- An \((m+1)\)-step iterative method of convergence order \((m+2)\) for linear complementarity problems. An \((m+1)\)-step iterative method for LCPs
- On lifting operators and regularity of nonsmooth Newton methods for optimal control problems of differential algebraic equations
- On finite termination of an iterative method for linear complementarity problems
- A class of smoothing functions for nonlinear and mixed complementarity problems
- A continuation method for monotone variational inequalities
- Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
- A smoothing inexact Newton method for \(P_0\) nonlinear complementarity problem
- A non-interior continuation method for generalized linear complementarity problems
- Convergence analysis of a smoothing SAA method for a stochastic mathematical program with second-order cone complementarity constraints
- Inverse semidefinite quadratic programming problem with \(l_1\) norm measure
- Smoothing Newton method for nonsmooth second-order cone complementarity problems with application to electric power markets
- Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines
- A smoothing Newton method preserving nonnegativity for solving tensor complementarity problems with \(P_0\) mappings
- An interior point parameterized central path following algorithm for linearly constrained convex programming
- 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 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 family of new smoothing functions and~a~nonmonotone smoothing Newton method for the nonlinear complementarity problems
- An improved LQP-based method for solving nonlinear complementarity problems
- Tensor complementarity problems. II: Solution methods
- A matrix-free smoothing algorithm for large-scale support vector machines
- General six-step discrete-time Zhang neural network for time-varying tensor absolute value equations
- A new noninterior continuation method for solving a system of equalities and inequalities
- A regularized smoothing Newton-type algorithm for quasi-variational inequalities
- A pathsearch damped Newton method for computing general equilibria
- Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions
- On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities
- Extension of smoothing functions to symmetric cone complementarity problems
- A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties
- 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
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
- A smoothing Levenberg-Marquardt method for NCP
- Convergence of a non-interior smoothing method for variational inequality problems
- A smoothing and regularization Broyden-like method for nonlinear inequalities
- A smoothing homotopy method for solving variational inequalities
- Superlinear/quadratic one-step smoothing Newton method for \(P_0\)-NCP
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
- 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
- Solvability of monotone tensor complementarity problems
- Complementarity problems over symmetric cones: A survey of recent developments in several aspects
- A smoothing least squares method for nonlinear complementarity problem
- Smoothing method for mathematical programs with symmetric cone complementarity constraints
- A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints
- A smoothing Newton's method for the construction of a damped vibrating system from noisy test eigendata
- A new one-step smoothing Newton method for the second-order cone complementarity problem
- A Noninterior Continuation Method for Quadratic and Linear Programming
- A fixed-point method for a class of super-large scale nonlinear complementarity problems
- The convex and monotone functions associated with second-order cone
- An interval method test for linear complementarity problems
- scientific article; zbMATH DE number 4011811 (Why is no real title available?)
- A full-Newton step non-interior continuation algorithm for a class of complementarity problems
- A General Framework of Continuation Methods for Complementarity Problems
- The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function
- scientific article; zbMATH DE number 2075805 (Why is no real title available?)
- scientific article; zbMATH DE number 2145258 (Why is no real title available?)
- Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Gradient consistency for integral-convolution smoothing functions
- Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
- A Newton-type algorithm for the tensor eigenvalue complementarity problem and some applications
- A continuation method for linear complementarity problems with \({P}_{0}\) matrix
- Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
- 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
- A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution
- A new homotopy method for solving non-linear complementarity problems
- The global linear and local quadratic convergence of a non-interior continuation algorithm for the LCP
- Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity.
- Verification for existence of solutions of linear complementarity problems
- Solving variational inequality problems via smoothing-nonsmooth reformulations
- Complexity of a noninterior path-following method for the linear complementarity problem
- A new smoothing quasi-Newton method for nonlinear complementarity problems
- Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms
- An infeasible-start path-following method for monotone LCPs
- MPCC strategies for nonsmooth nonlinear programs
- A novel non-linear approach to minimal area rectangular packing
- A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems
- 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 class of smoothing SAA methods for a stochastic mathematical program with complementarity constraints
- Adaptive spacetime discontinuous Galerkin method for hyperbolic advection-diffusion with a non-negativity constraint
- Discrete-time Euler-smoothing methods for time-varying convex constrained optimization
- Solving American option optimal control problems in financial markets using a novel neural network
- Polyhedral Newton-min algorithms for complementarity problems
- A fast smoothing newton method for bilevel hyperparameter optimization for SVC with logistic loss
- A semidefinite relaxation method for linear and nonlinear complementarity problems with polynomials
- Smoothing functions and smoothing Newton method for complementarity and variational inequality problems
This page was built for publication: A Non-Interior-Point Continuation Method for Linear Complementarity Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142623)