Advertisement

Fundamentals of Constrained Optimization

Abstract

The material presented so far dealt largely with principles, methods, and algorithms for unconstrained optimization. In this and the next five chapters, we build on the introductory principles of constrained optimization discussed in Secs. 1.4–1.6 and proceed to examine the underlying theory and structure of some very sophisticated and efficient constrained optimization algorithms.

Keywords

Lagrange Multiplier Equality Constraint Inequality Constraint Linear Programming Problem Feasible Region 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, NJ., 1963.MATHGoogle Scholar
  2. 2.
    S. J. Wright, Primal-Dual Interior-Point Methods, SIAM, Philadelphia, 1997.MATHGoogle Scholar
  3. 3.
    S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, SIAM, Philadelphia, 1994.MATHGoogle Scholar
  4. 4.
    Y. Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, 1994.MATHGoogle Scholar
  5. 5.
    J. T. Betts, “An accelerated multiplier method for nonlinear programming,” JOTA, vol. 21, no. 2, pp. 137–174, 1977.MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    G. Van der Hoek, Reduction Methods in Nonlinear Programming, Mathematical Centre Tracts, vol. 126, Mathematisch Centrum, Amsterdam, 1980.MATHGoogle Scholar
  7. 7.
    R. Fletcher, Practical Methods of Optimization, 2nd ed., Wiley, New York, 1987.MATHGoogle Scholar
  8. 8.
    G. H. Golub and C. F. Van Loan, Matrix Computations, 2nd ed., Baltimore, Johns Hopkins University Press, Baltimore, 1989.MATHGoogle Scholar
  9. 9.
    A. Antoniou, Digital Signal Processing: Signals, Systems, and Filters, McGraw-Hill, New York, 2005.Google Scholar
  10. 10.
    W.-S. Lu, “A parameterization method for the design of IIR digital filters with prescribed stability margin,” in Proc. Int. Symp. Circuits Syst., pp. 2381–2384, June 1997.Google Scholar
  11. 11.
    E. K. P. Chong and S. H. Żak, An Introduction to Optimization, Wiley, New York, 1996.MATHGoogle Scholar
  12. 12.
    H. W. Kuhn and A. W. Tucker, “Nonlinear programming,” in Proc. 2nd Berkeley Symp., pp. 481–492, Berkeley, CA, 1951.Google Scholar
  13. 13.
    D. G. Luenberger, Linear and Nonlinear Programming, 2nd ed., Addison-Wesley, Reading, MA, 1984.MATHGoogle Scholar
  14. 14.
    P. Wolfe, “Aduality theorem for nonlinear programming,” Quar. Appl. Math, vol. 19, pp. 239–244, 1961.MATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Personalised recommendations