Pages that link to "Item:Q4327920"
From MaRDI portal
The following pages link to A special newton-type optimization method (Q4327920):
Displayed 50 items.
- Smoothing functions and smoothing Newton method for complementarity and variational inequality problems (Q700708) (← links)
- A new smoothing and regularization Newton method for \(P_{0}\)-NCP (Q708899) (← links)
- Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
- Smoothing and SAA method for stochastic programming problems with non-smooth objective and constraints (Q727392) (← links)
- Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems (Q732492) (← links)
- Computation of generalized differentials in nonlinear complementarity problems (Q763389) (← links)
- An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function (Q781395) (← links)
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints (Q812423) (← links)
- A double nonmonotone quasi-Newton method for nonlinear complementarity problem based on piecewise NCP functions (Q826387) (← links)
- An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function (Q843152) (← links)
- Some structural properties of a Newton-type method for semidefinite programs (Q852154) (← links)
- Piecewise linear NCP function for QP free feasible method (Q854563) (← links)
- 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 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)