A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
From MaRDI portal
Publication:853883
Recommendations
- A new smoothing Newton-type method for second-order cone programming problems
- scientific article; zbMATH DE number 2070508
- Analysis of smoothing-type algorithms for the convex second-order cone programming
- A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
- Sub-quadratic convergence of a smoothing Newton method for second-order cone programming
Cites work
- scientific article; zbMATH DE number 1694914 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1059236 (Why is no real title available?)
- scientific article; zbMATH DE number 1569003 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
- A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A nonsmooth version of Newton's method
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- A reduced gradient method for quadratic programs with quadratic constraints and \(l_ p-\)constrained \(l_ p-\)approximation problems
- A regularization Newton method for solving nonlinear complementarity problems
- Applications of second-order cone programming
- Beyond Monotonicity in Regularization Methods for Nonlinear Complementarity Problems
- Complementarity problems over cones with monotone and pseudomonotone maps
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- High order infeasible-interior-point methods for solving sufficient linear complementarity problems
- Improved smoothing-type methods for the solution of linear programs
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- Normal Maps Induced by Linear Transformations
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- On the Accurate Identification of Active Constraints
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
- On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems
- Optimization and nonsmooth analysis
- Optimization. Algorithms and consistent approximations
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
- Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter
- Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems
- Regularization of \(P_{0}\)-functions in box variational inequality problems
- Second-order algorithms for generalized finite and semi-infinite min-max problems
- Semismooth and Semiconvex Functions in Constrained Optimization
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Stable monotone variational inequalities
- Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
- Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem
- Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists
- Superlinear convergence of an interior-point method despite dependent constraints
- Weak univalence and connectedness of inverse images of continuous functions
Cited in
(25)- Semismooth Newton method for quadratic programs with bound constraints
- A smoothing-type algorithm for solving system of inequalities
- Smoothing algorithms for complementarity problems over symmetric cones
- Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems
- Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem
- A smoothing self-adaptive Levenberg-Marquardt algorithm for solving system of nonlinear inequalities
- Robust solutions of uncertain complex-valued quadratically constrained programs
- Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization
- A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties
- A smoothing Newton's method for the construction of a damped vibrating system from noisy test eigendata
- Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines
- Finite termination of a Newton-type algorithm for a class of affine variational inequality problems
- Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions
- Extension of smoothing Newton algorithms to solve linear programming over symmetric cones
- A Nonmonotone Smoothing-Type Algorithm for a System of Inequalities Associated with Circular Cones
- A non-interior-point smoothing method for variational inequality problem
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- A matrix-free smoothing algorithm for large-scale support vector machines
- Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem
- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones
- A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search
- Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem
- A working set SQCQP algorithm with simple nonmonotone penalty parameters
- Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
- A non-interior continuation algorithm for solving the convex feasibility problem
This page was built for publication: A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853883)
