scientific article; zbMATH DE number 1569003
From MaRDI portal
Publication:4762533
zbMath0965.65091MaRDI QIDQ4762533
Publication date: 2 August 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
interior-point methoderror boundNewton methodsuperlinear convergencecomplementarity problemcontinuation/smoothing method
Numerical mathematical programming methods (65K05) Interior-point methods (90C51) Semi-infinite programming (90C34)
Related Items (25)
Exact optimal experimental designs with constraints ⋮ A smoothing inexact Newton method for variational inequalities with nonlinear constraints ⋮ A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming ⋮ Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity. ⋮ On the local convergence of a derivative-free algorithm for least-squares minimization ⋮ An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems ⋮ A smoothing Newton method for second-order cone optimization based on a new smoothing function ⋮ On the Quadratic Convergence of the Cubic Regularization Method under a Local Error Bound Condition ⋮ A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property ⋮ A smoothing inexact Newton method for nonlinear complementarity problems ⋮ A one-step smoothing Newton method for second-order cone programming ⋮ 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 ⋮ On the convergence of a trust-region method for solving constrained nonlinear equations with degenerate solutions ⋮ 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. ⋮ Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC ⋮ A smoothing Newton algorithm for solving the monotone second-order cone complementarity problems ⋮ Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems ⋮ A new smoothing Newton-type method for second-order cone programming problems ⋮ A variant smoothing Newton method for \(P_0\)-\(NCP\) based on a new smoothing function ⋮ Two error bounds for constrained optimization problems and their applications ⋮ Efficient regularized Newton-type algorithm for solving convex optimization problem ⋮ Superlinear/quadratic one-step smoothing Newton method for \(P_0\)-NCP
This page was built for publication:
