Pages that link to "Item:Q5573780"

The following pages link to An Efficient Computational Procedure for a Generalized Quadratic Programming Problem (Q5573780):

Displaying 14 items.

• Numerical methods for calculation of time-optimal control (Q278531) (← links)
• Method of successive projections for finding a common point of sets in metric spaces (Q911469) (← links)
• A base reduction method for convex programming (Q917445) (← links)
• Minimizing pseudoconvex functions on convex compact sets (Q1120481) (← links)
• Conditional gradient algorithms with open loop step size rules (Q1244889) (← links)
• An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane (Q1335567) (← links)
• A geometric computing method for nonlinear optimal regulator problems with singular arcs (Q1393929) (← links)
• An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set (Q1579636) (← links)
• A neural network measuring the intersection of \(m\)-dimensional convex polyhedra (Q1893014) (← links)
• Positivity embedding for noncolocated and nonsquare flexible systems (Q1893051) (← links)
• Numerical methods for control optimization in linear systems (Q2354500) (← links)
• Boundary control of distributed parabolic system with boundary condition involving a time-varying lag (Q3811259) (← links)
• Finding the nearest point in A polytope (Q4123085) (← links)
• A general one-dimensional search algorithm for computing approximate solutions of some non-linear optimal control problems (Q4776493) (← links)