Pages that link to "Item:Q3142623"
From MaRDI portal
The following pages link to A Non-Interior-Point Continuation Method for Linear Complementarity Problems (Q3142623):
Displaying 50 items.
- A fixed-point method for a class of super-large scale nonlinear complementarity problems (Q316584) (← links)
- A full-Newton step non-interior continuation algorithm for a class of complementarity problems (Q408218) (← links)
- The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function (Q434689) (← links)
- Gradient consistency for integral-convolution smoothing functions (Q491234) (← links)
- Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems (Q496609) (← links)
- Formulating an \(n\)-person noncooperative game as a tensor complementarity problem (Q523577) (← links)
- Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms (Q597176) (← links)
- An infeasible-start path-following method for monotone LCPs (Q597439) (← links)
- A novel non-linear approach to minimal area rectangular packing (Q610981) (← links)
- A cosh-based smoothing Newton method for \(P_{0}\) nonlinear complementarity problem (Q619712) (← links)
- A smoothing Levenberg-Marquardt algorithm for solving a class of stochastic linear complementarity problem (Q620991) (← links)
- A class of smoothing SAA methods for a stochastic mathematical program with complementarity constraints (Q645379) (← links)
- Smoothing functions and smoothing Newton method for complementarity and variational inequality problems (Q700708) (← links)
- Predictor-corrector smoothing methods for monotone LCP (Q705035) (← links)
- A new smoothing and regularization Newton method for \(P_{0}\)-NCP (Q708899) (← links)
- Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
- A smoothing Newton method for ncps with the \(P_{0}\)-property (Q716091) (← links)
- New multiplier method for solving linear complementarity problems (Q719949) (← links)
- Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems (Q732492) (← links)
- A smoothing Broyden-like method for the mixed complementarity problems (Q814293) (← links)
- A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints (Q816061) (← links)
- A global linear and local superlinear (quadratic) inexact non-interior continuation method for variational inequalities over general closed convex sets (Q829878) (← links)
- Analysis of a smoothing method for symmetric conic linear programming (Q854421) (← links)
- A class of smoothing methods for mathematical programs with complementarity constraints (Q878902) (← links)
- On almost smooth functions and piecewise smooth functions (Q881610) (← links)
- On convergence of a smoothing Broyden-like method for \(P_0\)-NCP (Q933555) (← links)
- A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs (Q960900) (← links)
- A smoothing Levenberg-Marquardt method for the extended linear complementarity problem (Q965571) (← links)
- Smoothing algorithms for complementarity problems over symmetric cones (Q967217) (← links)
- Some non-interior path-following methods based on a scaled central path for linear complementarity problems (Q969724) (← links)
- A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search (Q979319) (← links)
- A variant smoothing Newton method for \(P_0\)-\(NCP\) based on a new smoothing function (Q1003990) (← links)
- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones (Q1040694) (← links)
- A continuation method for (strongly) monotone variational inequalities (Q1290602) (← links)
- A new approach to continuation methods for complementarity problems with uniform \(P\)-functions (Q1376327) (← links)
- Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity. (Q1406258) (← links)
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function (Q1411490) (← links)
- The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem (Q1609708) (← links)
- Continuation method for nonlinear complementarity problems via normal maps (Q1610180) (← links)
- On bilevel programs with a convex lower-level problem violating Slater's constraint qualification (Q1626528) (← links)
- Smoothing Newton method for generalized complementarity problems based on a new smoothing function (Q1644521) (← links)
- An \((m+1)\)-step iterative method of convergence order \((m+2)\) for linear complementarity problems. An \((m+1)\)-step iterative method for LCPs (Q1676985) (← links)
- On lifting operators and regularity of nonsmooth Newton methods for optimal control problems of differential algebraic equations (Q1730398) (← links)
- On finite termination of an iterative method for linear complementarity problems (Q1814795) (← links)
- A class of smoothing functions for nonlinear and mixed complementarity problems (Q1815073) (← links)
- A continuation method for monotone variational inequalities (Q1908015) (← links)
- Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity (Q1928546) (← links)
- A smoothing inexact Newton method for \(P_0\) nonlinear complementarity problem (Q1946971) (← links)
- Convergence analysis of a smoothing SAA method for a stochastic mathematical program with second-order cone complementarity constraints (Q1983737) (← links)
- Inverse semidefinite quadratic programming problem with \(l_1\) norm measure (Q1987439) (← links)
