Long-step path-following algorithm for convex quadratic programming problems in a Hilbert space

DOI10.1023/A:1022626006554MaRDI QIDQ1379935zbMATHOpenAlexFDO

Authors L. Faybusovich, John Moore

Publication date 5 March 1998

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1022626006554

zbMATH Keywords

quadratic programmingHilbert spacelinear-quadratic control problemNewton methodinterior-point technique

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear-quadratic optimal control problems (49N10) Programming in abstract spaces (90C48)

Recommendations

• A path following algorithm for infinite quadratic programming on a Hilbert space
• Calculation method for quadratic programming problem in Hilbert spaces partially ordered by cone with empty interior
• Infinite-dimensional quadratic optimization: Interior-point methods and control applications
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Numerical methods of nonlinear optimal control based on mathematical programming

Cites work

• scientific article; zbMATH DE number 3163006 (Why is no real title available?)
• scientific article; zbMATH DE number 4204836 (Why is no real title available?)
• scientific article; zbMATH DE number 3502257 (Why is no real title available?)
• scientific article; zbMATH DE number 3521839 (Why is no real title available?)
• scientific article; zbMATH DE number 3603899 (Why is no real title available?)
• scientific article; zbMATH DE number 590363 (Why is no real title available?)
• scientific article; zbMATH DE number 701754 (Why is no real title available?)
• Infinite-dimensional quadratic optimization: Interior-point methods and control applications
• Optimization and dynamical systems
• Semidefinite Programming: A Path-Following Algorithm for a Linear–Quadratic Functional
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories

Cited in

(11)

• A self-concordant interior point approach for optimal control with state constraints
• Trajectory-following methods for large-scale degenerate convex quadratic programming
• A path-following slgorithm for stochastic quadratically constrained convex quadratic programming in a Hilbert space
• A long-step barrier method for convex quadratic programming
• On Long Step Path Following and SUMT for Linear and Quadratic Programming
• Infinite-dimensional quadratic optimization: Interior-point methods and control applications
• scientific article; zbMATH DE number 1182576 (Why is no real title available?)
• Separation theorem for linearly constrained LQG optimal control
• Calculation method for quadratic programming problem in Hilbert spaces partially ordered by cone with empty interior
• scientific article; zbMATH DE number 1264398 (Why is no real title available?)
• Logarithmic-barrier decomposition interior-point methods for stochastic linear optimization in a Hilbert space

This page was built for publication: Long-step path-following algorithm for convex quadratic programming problems in a Hilbert space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379935)