General Nonlinear Optimization Problems
The most general class of optimization problems is the class of problems where both the objective function and the constraints are nonlinear, as formulated in Eq. (10.1). These problems can be solved by using a variety of methods such as penalty- and barrier-function methods, gradient projection methods, and sequential quadratic-programming (SQP) methods . Among these methods, SQP algorithms have proved highly effective for solving general constrained problems with smooth objective and constraint functions . A more recent development in nonconvex constrained optimization is the extension of the modern interior-point approaches of Chaps. 12–14 to the general class of nonlinear problems.
KeywordsLine Search Feasible Region Merit Function Apply Algorithm Nonconvex Problem
Unable to display preview. Download preview PDF.
- 2.P. E. Gill, W. Murray, and M. A. Saunders, “SNOPT: An SQP algorithm for large-scale constrained optimization,” Research Report NA 97-2, Dept. of Mathematics, Univ. of California, San Diego, 1997.Google Scholar
- 3.R. B. Wilson, A Simplicial Method for Concave Programming, Ph.D. dissertation, Graduate School of Business Administration, Harvard University, Cambridge, MA., 1963.Google Scholar
- 5.G. H. Goluband C. F. Van Loan, Matrix Computation, 2nd ed., Baltimore, The Johns Hopkins University Press, MD, 1989.Google Scholar
- 8.M. H. Wright, “Direct search methods: Once scorned, now respectable,” in Numerical Analysis 1995, D.F. Griffiths and G. A. Watson eds., pp. 191–208, Addison Wesley Longman, UK.Google Scholar
- 10.A. Forsgren and P. Gill, “Primal-dual interior methods for nonconvex nonlinear programming,” Technical Report NA-96-3, Dept. of Mathematics, Univ. of California, San Diego, 1996.Google Scholar
- 11.D. M. Gay, M. L. Overton, and M. H. Wright, “A primal-dual interior method for nonconvex nonlinear programming,” Proc. 1996 Int. Conf. on Nonlinear Programming, Kluwer Academic Publishers, 1998.Google Scholar
- 12.R. J. Vanderbei and D. F. Shanno, “An interior-point algorithm for nonconvex nonlinear programming,” Research Report SOR-97-21 (revised), Statistics and Operations Res., Princeton University, June 1998.Google Scholar
- 13.D. F. Shanno and R. J. Vanderbei, “Interior-point methods for nonconvex nonlinear programming: Orderings and high-order methods,” Research Report SOR-99-5, Statistics and Operations Res., Princeton University, May 1999.Google Scholar