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 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)
- 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)
- A new Jacobian-like method for the polyhedral cone-constrained eigenvalue problem (Q1955268) (← links)
- Nonlinear boundary equation approach for inequality 2-D elastodynamics (Q1961602) (← links)
- On generalized convexity of nonlinear complementarity functions (Q2260699) (← links)
- A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions (Q2268920) (← links)
- A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems (Q2269819) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints (Q2369090) (← links)
- Neural network models and its application for solving linear and quadratic programming problems (Q2369095) (← links)
- On the Newton-type method with admissible trajectories for mixed complementarity problems (Q2371594) (← links)
- Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem (Q2383649) (← links)
- A filter method for solving nonlinear complementarity problems based on derivative-free line search (Q2383752) (← links)
- A Newton's method for perturbed second-order cone programs (Q2385540) (← links)
- A new method for solving Pareto eigenvalue complementarity problems (Q2393646) (← links)