Pages that link to "Item:Q4327920"
From MaRDI portal
The following pages link to A special newton-type optimization method (Q4327920):
Displayed 50 items.
- A regularization smoothing Newton method for solving nonlinear complementarity problem (Q1015087) (← links)
- On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem (Q1021668) (← links)
- A smoothing conic trust region filter method for the nonlinear complementarity problem (Q1023330) (← links)
- Globally convergent Jacobian smoothing inexact Newton methods for NCP (Q1029625) (← links)
- A global continuation algorithm for solving binary quadratic programming problems (Q1029635) (← links)
- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones (Q1040694) (← links)
- Inexact non-interior continuation method for solving large-scale monotone SDCP (Q1044421) (← links)
- New constrained optimization reformulation of complementarity problems (Q1264991) (← links)
- Derivative-free methods for monotone variational inequality and complementarity problems (Q1273171) (← links)
- Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities (Q1290651) (← links)
- An unconstrained optimization technique for large-scale linearly constrained convex minimization problems (Q1337633) (← 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)
- Error bounds in mathematical programming (Q1365060) (← links)
- New NCP-functions and their properties (Q1367789) (← links)
- Global method for monotone variational inequality problems with inequality constraints (Q1372565) (← 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)
- Complementarity problems in GAMS and the PATH solver (Q1605705) (← links)
- A cell-based dynamic traffic assignment model: Formulation and properties (Q1609417) (← links)
- The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem (Q1609708) (← links)
- A smoothing Levenberg-Marquardt method for nonlinear complementarity problems (Q1625776) (← links)
- On bilevel programs with a convex lower-level problem violating Slater's constraint qualification (Q1626528) (← links)
- Extended semismooth Newton method for functions with values in a cone (Q1653673) (← links)
- Discovery of new complementarity functions for NCP and SOCCP (Q1715644) (← links)
- A new smoothing conjugate gradient method for solving nonlinear nonsmooth complementarity problems (Q1736744) (← links)
- Computing feasible points for binary MINLPs with MPECs (Q1741127) (← links)
- An inexact Newton method for solving complementarity problems in hydrodynamic lubrication (Q1742966) (← links)
- Linear complementarity problems on extended second order cones (Q1743527) (← links)
- Augmented Lagrangian and exact penalty methods for quasi-variational inequalities (Q1744910) (← links)
- Semismooth Newton methods with domain decomposition for American options (Q1747290) (← links)
- Link-based multi-class hazmat routing-scheduling problem: a multiple demon approach (Q1753580) (← links)
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem (Q1761957) (← links)
- A Jacobian smoothing method for box constrained variational inequality problems (Q1765876) (← links)
- Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions (Q1772966) (← links)
- Symmetrization of generalized natural residual function for NCP (Q1785378) (← links)
- Computational methods for elastoplasticity: an overview of conventional and \textit{less-conventional} approaches (Q1787380) (← links)
- On finite termination of an iterative method for linear complementarity problems (Q1814795) (← links)
- On the resolution of monotone complementarity problems (Q1815077) (← links)
- Global Newton-type methods and semismooth reformulations for NCP (Q1861964) (← links)
- An application of anisotropic regularization to the existence of weak Pareto minimal points (Q1874620) (← links)
- Inexact Newton methods for solving nonsmooth equations (Q1900757) (← links)
- A Newton-type method for positive-semidefinite linear complementarity problems (Q1905937) (← links)
- Nonlinear complementarity as unconstrained optimization (Q1908649) (← links)
- A smoothing SAA method for a stochastic mathematical program with complementarity constraints. (Q1928176) (← links)
- A nonlinear complementarity approach for elastoplastic problems by BEM without internal cells (Q1944461) (← links)
- A Newton-type algorithm for solving problems of search theory (Q1953229) (← links)
- A smoothing inexact Newton method for generalized nonlinear complementarity problem (Q1954743) (← links)
- A globally convergent filter-type trust region method for semidefinite programming (Q1955230) (← links)