A new path-following algorithm for nonlinear P_* complementarity problems
From MaRDI portal
(Redirected from Publication:853548)
A new path-following algorithm for nonlinear \(P *\) complementarity problems
A new path-following algorithm for nonlinear \(P *\) complementarity problems
Recommendations
- The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform \(P\)-functions
- scientific article; zbMATH DE number 5138975
- A smoothing Newton method based on a scaled central path for nonlinear complementarity problems
- The global linear convergence of a noninterior path-following algorithm for linear complementarity problems
- Two interior-point methods for nonlinear P_*()-complementarity problems.
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 1306985 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 1424532 (Why is no real title available?)
- scientific article; zbMATH DE number 3420462 (Why is no real title available?)
- A Global and Local Superlinear Continuation-Smoothing Method forP0andR0NCP or Monotone NCP
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
- A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
- A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An Infeasible Path-Following Method for Monotone Complementarity Problems
- An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP
- Beyond Monotonicity in Regularization Methods for Nonlinear Complementarity Problems
- Computational complexity of LCPs associated with positive definite symmetric matrices
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Existence and Limiting Behavior of a Non--Interior-Point Trajectory for Nonlinear Complementarity Problems Without Strict Feasibility Condition
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- High order infeasible-interior-point methods for solving sufficient linear complementarity problems
- Homotopy Continuation Methods for Nonlinear Complementarity Problems
- Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
- Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
- Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- On a homogeneous algorithm for the monotone complementarity problem
- On a new homotopy continuation trajectory for nonlinear complementary problems.
- On homogeneous and self-dual algorithms for LCP
- On the connectedness of solution sets in linear complementarity problems
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
- Properties of a Multivalued Mapping Associated with Some Nonmonotone Complementarity Problems
- Regularization of \(P_{0}\)-functions in box variational inequality problems
- Solving the Nonlinear Complementarity Problem by a Homotopy Method
- Strict feasibility conditions in nonlinear complementarity problems
- Structural and stability properties of \(P_0\) nonlinear complementarity problems
- Sufficient matrices and the linear complementarity problem
- The global linear convergence of a noninterior path-following algorithm for linear complementarity problems
- Tihonov's regularization and the complementarity problem in Hilbert spaces
Cited in
(14)- The global linear convergence of a noninterior path-following algorithm for linear complementarity problems
- Interior point algorithm for \(P_*\) nonlinear complementarity problems
- A non-interior implicit smoothing approach to complementarity problems for frictionless contacts
- Some non-interior path-following methods based on a scaled central path for linear complementarity problems
- A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones
- A new smoothing conjugate gradient method for solving nonlinear nonsmooth complementarity problems
- Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP
- On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems
- A Predictor-Corrector Path-Following Algorithm for Dual-Degenerate Parametric Optimization Problems
- Solvability of implicit semidefinite and implicit copositive complementarity problems
- scientific article; zbMATH DE number 5138975 (Why is no real title available?)
- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem
- An Infeasible Path-Following Method for Monotone Complementarity Problems
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
This page was built for publication: A new path-following algorithm for nonlinear \(P_*\) complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853548)
