A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
From MaRDI portal
Publication:853883
DOI10.1007/s10589-006-6512-7zbMath1151.90509OpenAlexW2132402006MaRDI QIDQ853883
Gongyun Zhao, Zheng-Hai Huang, Defeng Sun
Publication date: 17 November 2006
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-006-6512-7
Quadratic programming (90C20) Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems, A non-interior continuation algorithm for solving the convex feasibility problem, Finite termination of a Newton-type algorithm for a class of affine variational inequality problems, A Nonmonotone Smoothing-Type Algorithm for a System of Inequalities Associated with Circular Cones, Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions, A working set SQCQP algorithm with simple nonmonotone penalty parameters, A smoothing-type algorithm for solving system of inequalities, Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem, Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem, A smoothing Newton's method for the construction of a damped vibrating system from noisy test eigendata, A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties, A non-interior-point smoothing method for variational inequality problem, Smoothing algorithms for complementarity problems over symmetric cones, Extension of smoothing Newton algorithms to solve linear programming over symmetric cones, Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization, A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search, A smoothing self-adaptive Levenberg-Marquardt algorithm for solving system of nonlinear inequalities, A matrix-free smoothing algorithm for large-scale support vector machines, Robust solutions of uncertain complex-valued quadratically constrained programs, Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines, Finite termination 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, Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions, Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stable monotone variational inequalities
- Applications of second-order cone programming
- A reduced gradient method for quadratic programs with quadratic constraints and \(l_ p-\)constrained \(l_ p-\)approximation problems
- Complementarity problems over cones with monotone and pseudomonotone maps
- Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Improved smoothing-type methods for the solution of linear programs
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Optimization. Algorithms and consistent approximations
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
- A regularization Newton method for solving nonlinear complementarity problems
- On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems
- Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter
- Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem
- Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
- 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
- Regularization of P0-Functions in Box Variational Inequality Problems
- Second-Order Algorithms for Generalized Finite and Semi-Infinite Min-Max Problems
- High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems
- Superlinear Convergence of an Algorithm for Monotone Linear Complementarity Problems, When No Strictly Complementary Solution Exists
- Weak Univalence and Connectedness of Inverse Images of Continuous Functions
- Superlinear Convergence of an Interior-Point Method Despite Dependent Constraints
- Optimization and nonsmooth analysis
- On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
- Normal Maps Induced by Linear Transformations
- Semismooth and Semiconvex Functions in Constrained Optimization
- On the Accurate Identification of Active Constraints
- Beyond Monotonicity in Regularization Methods for Nonlinear Complementarity Problems
- A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition
