A New Algorithm for Solving Strictly Convex Quadratic Programs
From MaRDI portal
Publication:4377566
DOI10.1137/S1052623493246045zbMath0891.90133OpenAlexW2014405554MaRDI QIDQ4377566
Publication date: 10 February 1998
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623493246045
Newton methodsexact penalty functionsactive-set methodsconvex quadratic programsconvex quadratic splines
Related Items
A primal‐dual active‐set method for distributed model predictive control, Error estimates and Lipschitz constants for best approximation in continuous function spaces, Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines, A dual approach to constrained interpolation from a convex subset of Hilbert space, Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities, A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines, Computing upper and lower bounds in interval decision trees, Hybrid algorithms with active set prediction for solving linear inequalities in a least squares sense, A global piecewise smooth Newton method for fast large-scale model predictive control, Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs, A parallel quadratic programming method for dynamic optimization problems, Dominant speed factors of active set methods for fast MPC, A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming, A finite newton method for classification, Bi-criteria optimal control of redundant robot manipulators using LVI-based primal-dual neural network, A novel neural dynamical approach to convex quadratic program and its efficient applications, An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization, Some results on nearest points in normed linear spaces, Regularized gap function as penalty term for constrained minimization problems, On Newton's method for Huber's robust M-estimation problems in linear regression, Newton's method for linear inequality systems, A dual neural network for convex quadratic programming subject to linear equality and inequality constraints
