Pages that link to "Item:Q689133"
From MaRDI portal
The following pages link to NE/SQP: A robust algorithm for the nonlinear complementarity problem (Q689133):
Displaying 50 items.
- A new active-set strategy for NCP with degenerate solutions (Q273257) (← links)
- A rolling horizon approach for stochastic mixed complementarity problems with endogenous learning: application to natural gas markets (Q342287) (← links)
- New double projection algorithm for solving variational inequalities (Q364484) (← links)
- A tri-dimensional filter SQP algorithm for variational inequality problems (Q382458) (← links)
- A new extragradient-like method for solving variational inequality problems (Q383889) (← links)
- On regularity conditions for complementarity problems (Q404520) (← links)
- Equilibration techniques for solving contact problems with Coulomb friction (Q423554) (← 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)
- Smoothing Levenberg-Marquardt method for general nonlinear complementarity problems under local error bound (Q534917) (← links)
- Modified extragradient method for variational inequalities and verification of solution existence (Q597166) (← links)
- A cosh-based smoothing Newton method for \(P_{0}\) nonlinear complementarity problem (Q619712) (← links)
- A new smoothing Broyden-like method for solving nonlinear complementarity problem with a \(P_{0}\)-function (Q652695) (← links)
- Nonlinear complementarity functions for plasticity problems with frictional contact (Q660391) (← links)
- A new smoothing and regularization Newton method for \(P_{0}\)-NCP (Q708899) (← links)
- Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems (Q732492) (← links)
- Modified modulus-based matrix splitting algorithms for a class of weakly nondifferentiable nonlinear complementarity problems (Q739021) (← links)
- A double nonmonotone quasi-Newton method for nonlinear complementarity problem based on piecewise NCP functions (Q826387) (← links)
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems (Q853548) (← links)
- Numerical comparisons of two effective methods for mixed complementarity problems (Q966077) (← links)
- Smoothing Newton method for NCP with the identification of degenerate indices (Q989148) (← links)
- On the computation of an element of Clarke generalized Jacobian for a vector-valued max function (Q1049060) (← links)
- New constrained optimization reformulation of complementarity problems (Q1264991) (← links)
- An NE/SQP method for the bounded nonlinear complementarity problem (Q1265015) (← links)
- A superlinearly convergent projection algorithm for solving the convex inequality problem (Q1271387) (← links)
- Elastoplastic analysis of structures with nonlinear hardening: A nonlinear complementarity approach (Q1309901) (← links)
- Nonlinear complementarity as unconstrained and constrained minimization (Q1321650) (← links)
- A degree-theoretic approach to parametric nonsmooth equations with multivalued perturbed solution sets (Q1321654) (← links)
- A parameterized Newton method and a quasi-Newton method for nonsmooth equations (Q1326511) (← links)
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems (Q1356056) (← links)
- A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems (Q1356057) (← links)
- Solution of monotone complementarity problems with locally Lipschitzian functions (Q1356058) (← links)
- QPCOMP: A quadratic programming based solver for mixed complementarity problems (Q1356059) (← links)
- On unconstrained and constrained stationary points of the implicit Lagrangian (Q1364220) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
- Stationary points of bound constrained minimization reformulations of complementarity problems (Q1367727) (← 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)
- A positive interior-point algorithm for nonlinear complementarity problems. (Q1418289) (← links)
- An SQP method for general nonlinear complementarity problems (Q1595262) (← links)
- A residual algorithm for finding a fixed point of a nonexpansive mapping (Q1615317) (← links)
- Modified Tseng's extragradient algorithms for variational inequality problems (Q1615363) (← links)
- A regularized smoothing Newton method for solving SOCCPs based on a new smoothing C-function (Q1644067) (← links)
- Weak and strong convergence theorems for variational inequality problems (Q1656659) (← 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)
- Extragradient methods for solving non-Lipschitzian pseudo-monotone variational inequalities (Q1713963) (← links)
- On minimizing and stationary sequences of a new class of merit functions for nonlinear complementarity problems (Q1807824) (← links)
- A class of smoothing functions for nonlinear and mixed complementarity problems (Q1815073) (← links)
- On the resolution of monotone complementarity problems (Q1815077) (← links)
- On the equivalence of linear complementarity problems (Q1866003) (← links)
- A globally convergent Newton method for convex \(SC^ 1\) minimization problems (Q1896575) (← links)