scientific article; zbMATH DE number 1569003
From MaRDI portal
Publication:4762533
Recommendations
- Superlinear convergence of a Newton-type algorithm for monotone equations
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- On the convergence of an inexact Newton-type method
- scientific article; zbMATH DE number 1329062
Cited in
(29)- A variant smoothing Newton method for P₀-NCP based on a new smoothing function
- Two error bounds for constrained optimization problems and their applications
- Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity.
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- On the convergence of a trust-region method for solving constrained nonlinear equations with degenerate solutions
- Superlinear convergence of a Newton-type algorithm for monotone equations
- Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC
- Efficient regularized Newton-type algorithm for solving convex optimization problem
- Exact optimal experimental designs with constraints
- A smoothing inexact Newton method for variational inequalities with nonlinear constraints
- Self-adaptive inexact proximal point methods
- The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function
- A smoothing Newton algorithm for solving the monotone second-order cone complementarity problems
- Superlinear/quadratic one-step smoothing Newton method for \(P_0\)-NCP
- An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems
- scientific article; zbMATH DE number 1329062 (Why is no real title available?)
- On the local convergence of a derivative-free algorithm for least-squares minimization
- On the quadratic convergence of the cubic regularization method under a local error bound condition
- A smoothing inexact Newton method for nonlinear complementarity problems
- A smoothing Newton method for second-order cone optimization based on a new smoothing function
- Fast convergence to non-isolated minima: four equivalent conditions for \({\mathrm{C}^2}\) functions
- A new smoothing and regularization Newton method for \(P_{0}\)-NCP
- A smoothing-type Newton method for second-order cone programming problems based on a new smooth function
- A new one-step smoothing Newton method for second-order cone programming.
- A unified approach to smoothing and regularization for SOCCPs under local error bound
- Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems
- A new smoothing Newton-type method for second-order cone programming problems
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
- A one-step smoothing Newton method for second-order cone programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4762533)
