An Efficient Computational Procedure for a Generalized Quadratic Programming Problem
From MaRDI portal
Cited in
(15)- Minimizing pseudoconvex functions on convex compact sets
- Conditional gradient algorithms with open loop step size rules
- An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane
- A geometric computing method for nonlinear optimal regulator problems with singular arcs
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set
- A neural network measuring the intersection of m-dimensional convex polyhedra
- Positivity embedding for noncolocated and nonsquare flexible systems
- Numerical methods for control optimization in linear systems
- Numerical methods for calculation of time-optimal control
- Boundary control of distributed parabolic system with boundary condition involving a time-varying lag
- Finding the nearest point in A polytope
- A general one-dimensional search algorithm for computing approximate solutions of some non-linear optimal control problems
- Numerical methods for solving minimum-time problem for linear systems
- Method of successive projections for finding a common point of sets in metric spaces
- A base reduction method for convex programming
This page was built for publication: An Efficient Computational Procedure for a Generalized Quadratic Programming Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5573780)
