A New Algorithm for Solving Strictly Convex Quadratic Programs

Authors:
Wu Li;John Swetits
Affiliations:
-;-
Venue:
SIAM Journal on Optimization
Year:
1997

Citing 0
Cited 7

An Exterior Newton Method for Strictly Convex Quadratic Programming

Computational Optimization and Applications
Repetitive motion of redundant robots planned by three kinds of recurrent neural networks and illustrated with a four-link planar manipulator's straight-line example

Robotics and Autonomous Systems
A novel neural dynamical approach to convex quadratic program and its efficient applications

Neural Networks
A fast algorithm for AR parameter estimation using a novel noise-constrained least-squares method

Neural Networks
Performance analysis of gradient neural network exploited for online time-varying quadratic minimization and equality-constrained quadratic programming

Neurocomputing
A global piecewise smooth Newton method for fast large-scale model predictive control

Automatica (Journal of IFAC)
Repetitive motion planning of redundant robots based on LVI-based primal-dual neural network and PUMA560 example

LSMS'07 Proceedings of the 2007 international conference on Life System Modeling and Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We reformulate convex quadratic programs with simple bound constraints and strictly convex quadratic programs as problems of unconstrained minimization of convex quadratic splines. Therefore, any algorithm for finding a minimizer of a convex quadratic spline can be used to solve these quadratic programming problems. In this paper, we propose a Newton method to find a minimizer of a convex quadratic spline derived from the unconstrained reformulation of a strictly convex quadratic programming problem. The Newton method is a "natural mixture" of a descent method and an active-set method. Moreover, it is an iterative method, yet it terminates in finite operations (in exact arithmetic).