A New Algorithm for Solving Strictly Convex Quadratic Programs
From MaRDI portal
Recommendations
- An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints.
- A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
- A numerically stable dual method for solving strictly convex quadratic programs
- Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
- scientific article; zbMATH DE number 4037611
Cited in
(38)- Regularized gap function as penalty term for constrained minimization problems
- Algorithms for bound constrained quadratic programming problems
- New theoretical results on recursive quadratic programming algorithms
- On Newton's method for Huber's robust M-estimation problems in linear regression
- Newton's method for linear inequality systems
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- A modified projection algorithm for large strictly-convex quadratic programs
- A dual neural network for convex quadratic programming subject to linear equality and inequality constraints
- Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs
- Algebraic solution of the problems of nonconvex quadratic programming
- A novel neural dynamical approach to convex quadratic program and its efficient applications
- 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 new algorithm for solving the general quadratic programming problem
- A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
- An exterior Newton method for strictly convex quadratic programming
- A hybrid direction algorithm for solving a convex quadratic problem
- Hybrid algorithms with active set prediction for solving linear inequalities in a least squares sense
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
- Semismooth Newton method for quadratic programs with bound constraints
- Bi-criteria optimal control of redundant robot manipulators using LVI-based primal-dual neural network
- A Newton Method for Convex Regression, Data Smoothing, and Quadratic Programming with Bounded Constraints
- An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
- Some results on nearest points in normed linear spaces
- scientific article; zbMATH DE number 3982419 (Why is no real title available?)
- scientific article; zbMATH DE number 1382488 (Why is no real title available?)
- scientific article; zbMATH DE number 708838 (Why is no real title available?)
- A finite newton method for classification
- A parallel quadratic programming method for dynamic optimization problems
- A primal-dual active-set method for distributed model predictive control
- A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds
- scientific article; zbMATH DE number 6263278 (Why is no real title available?)
- Dominant speed factors of active set methods for fast MPC
- A global piecewise smooth Newton method for fast large-scale model predictive control
- A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming
- A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings
- Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities
- Computing upper and lower bounds in interval decision trees
This page was built for publication: A New Algorithm for Solving Strictly Convex Quadratic Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377566)
