Skip to main content
Log in

Long-Step Path-Following Algorithm for Convex Quadratic Programming Problems in a Hilbert Space

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

We develop an interior-point technique for solving quadratic programming problems in a Hilbert space. As an example, we consider an application of these results to the linear-quadratic control problem with linear inequality constraints. It is shown that the Newton step in this situation is basically reduced to solving the standard linear-quadratic control problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. DEN HERTOG, D., Interior-Point Approach to Linear, Quadratic, and Convex Programming, Kluwer Academic Publishers, Dordrecht, Netherlands, 1994.

    Google Scholar 

  2. FAYBUSOVICH, L., Semi-Definite Programming: A Path-Following Algorithm for a Linear-Quadratic Functional, SIAM Journal on Optimization, Vol. 6, pp. 1007–1024, 1996.

    Google Scholar 

  3. HELMKE, U., and MOORE, J. B., Optimization and Dynamical Systems, Springer, New York, New York, 1994.

    Google Scholar 

  4. FAYBUSOVICH, L., and MOORE, J. B., Infinite-Dimensional Quadratic Optimization: Interior-Point Methods and Control Applications, Journal of Applied Mathematics and Optimization, Vol. 36, pp. 43–66, 1997.

    Google Scholar 

  5. FAYBUSOVICH, L., Wolfe's Algorithm for Infinite-Dimensional Quadratic Programming Problems, Engineering Cybernetics, No. 3, pp. 20–30, 1982.

    Google Scholar 

  6. FAYBUSOVICH, L., Application of a Reduction Method to the Analysis of Linear Dynamical Systems with Phase Constraints, Automation and Remoted Control, No. 8, pp. 1014–1020, 1982.

    Google Scholar 

  7. BLOCH, A., Steepest Descent, Linear Programming, and Hamiltonian Flows, Contemporary Mathematics, Vol. 114, pp. 77–90, 1990.

    Google Scholar 

  8. BAYER, D., and LAGARIAS, J., The Nonlinear Geometry of Linear Programming, Transactions of the American Mathematical Society, Vol. 314, pp. 499–581, 1989.

    Google Scholar 

  9. WONG, W. S., Gradient Flows for Local Minima of Combinatorial Optimization Problems, Fields Institute Communications, Vol. 3, pp. 145–155, 1994.

    Google Scholar 

  10. ORTEGA, J. M., and RHEINHOLDT, W. C., Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, New York, 1970.

    Google Scholar 

  11. BALAKRISHNAN, A. V., Applied Functional Analysis, Springer, New York, New York, 1976.

    Google Scholar 

  12. DIEUDONNÉ, J., Foundations of Modern Analysis, Academic Press, New York, New York, 1960.

    Google Scholar 

  13. ANDERSON, B. D. O., and MOORE, J. B., Linear Optimal Control, Prentice-Hall, Englewood Cliffs, New Jersey, 1971.

    Google Scholar 

  14. SAGE, A., and WHITE, C., III, Optimum Systems Control, Prentice-Hall, Englewood Cliffs, New Jersey, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Faybusovich, L., Moore, J.B. Long-Step Path-Following Algorithm for Convex Quadratic Programming Problems in a Hilbert Space. Journal of Optimization Theory and Applications 95, 615–635 (1997). https://doi.org/10.1023/A:1022626006554

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022626006554

Navigation