Pages that link to "Item:Q4327920"

The following pages link to A special newton-type optimization method (Q4327920):

Displaying 50 items.

• Two classes of merit functions for the second-order cone complementarity problem (Q857837) (← links)
• The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem (Q858580) (← links)
• A derivative-free filter algorithm for nonlinear complementarity problem (Q861186) (← links)
• A new filter method for solving nonlinear complementarity problems (Q870225) (← links)
• A Newton-type method and its application (Q885591) (← links)
• A generalized Newton method of high-order convergence for solving the large-scale linear complementarity problem (Q903210) (← links)
• Doubly uncertain transportation network: degradable capacity and stochastic demand (Q930952) (← links)
• A smoothing QP-free infeasible method for nonlinear inequality constrained optimization (Q933072) (← links)
• A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs (Q939548) (← links)
• Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization (Q959946) (← links)
• Superlinearly convergent affine scaling interior trust-region method for linear constrained \(LC^{1}\) minimization (Q960640) (← links)
• A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs (Q960900) (← links)
• Solving models with inequalities using standard econometric software (Q961400) (← links)
• A smoothing Levenberg-Marquardt method for the extended linear complementarity problem (Q965571) (← links)
• New approach for the nonlinear programming with transient stability constraints arising from power systems (Q967215) (← links)
• A globally convergent method based on Fischer-Burmeister operators for solving second-order cone constrained variational inequality problems (Q979810) (← links)
• A self-adaptive trust region method for the extended linear complementarity problems (Q993286) (← links)
• A family of NCP functions and a descent method for the nonlinear complementarity problem (Q1001190) (← links)
• A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property (Q1005258) (← links)
• A nonsmooth Newton's method for control-state constrained optimal control problems (Q1010002) (← links)
• Feasible semismooth Newton method for a class of stochastic linear complementarity problems (Q1014020) (← links)
• 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)
• Karush-Kuhn-Tucker systems: regularity conditions, error bounds and a class of Newton-type methods (Q1396838) (← 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)