An Efficient Computational Procedure for a Generalized Quadratic Programming Problem
From MaRDI portal
Publication:5573780
DOI10.1137/0307030zbMath0182.20701OpenAlexW2003808007MaRDI QIDQ5573780
Publication date: 1969
Published in: SIAM Journal on Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0307030
Related Items (14)
Numerical methods for calculation of time-optimal control ⋮ An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane ⋮ A neural network measuring the intersection of \(m\)-dimensional convex polyhedra ⋮ Positivity embedding for noncolocated and nonsquare flexible systems ⋮ Minimizing pseudoconvex functions on convex compact sets ⋮ A geometric computing method for nonlinear optimal regulator problems with singular arcs ⋮ Method of successive projections for finding a common point of sets in metric spaces ⋮ A base reduction method for convex programming ⋮ Boundary control of distributed parabolic system with boundary condition involving a time-varying lag ⋮ Finding the nearest point in A polytope ⋮ Conditional gradient algorithms with open loop step size rules ⋮ An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set ⋮ Numerical methods for control optimization in linear systems ⋮ A general one-dimensional search algorithm for computing approximate solutions of some non-linear optimal control problems
This page was built for publication: An Efficient Computational Procedure for a Generalized Quadratic Programming Problem
