Pages that link to "Item:Q4377566"

The following pages link to A New Algorithm for Solving Strictly Convex Quadratic Programs (Q4377566):

Displaying 21 items.

• A parallel quadratic programming method for dynamic optimization problems (Q499159) (← links)
• A global piecewise smooth Newton method for fast large-scale model predictive control (Q644265) (← links)
• A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming (Q706949) (← links)
• Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities (Q868635) (← links)
• Computing upper and lower bounds in interval decision trees (Q877064) (← links)
• Regularized gap function as penalty term for constrained minimization problems (Q1018314) (← links)
• On Newton's method for Huber's robust M-estimation problems in linear regression (Q1279695) (← links)
• Newton's method for linear inequality systems (Q1296136) (← links)
• A dual approach to constrained interpolation from a convex subset of Hilbert space (Q1369249) (← links)
• A dual neural network for convex quadratic programming subject to linear equality and inequality constraints (Q1600289) (← links)
• Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs (Q1737602) (← links)
• A novel neural dynamical approach to convex quadratic program and its efficient applications (Q1784530) (← links)
• Error estimates and Lipschitz constants for best approximation in continuous function spaces (Q1904181) (← links)
• Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines (Q1904957) (← links)
• A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines (Q1919811) (← links)
• Hybrid algorithms with active set prediction for solving linear inequalities in a least squares sense (Q2672733) (← links)
• An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization (Q2805706) (← links)
• Bi-criteria optimal control of redundant robot manipulators using LVI-based primal-dual neural network (Q3057004) (← links)
• Some results on nearest points in normed linear spaces (Q3379078) (← links)
• A primal‐dual active‐set method for distributed model predictive control (Q5280135) (← links)
• Dominant speed factors of active set methods for fast MPC (Q5745039) (← links)