Nonlinear Programming: Analysis and Methods 来自 Semantic Scholar 喜欢 0 阅读量: 586 作者: A Mordecai 摘要: This text provides an excellent bridge between principal theories and concepts and their practical implementation. Topics include convex programming, duality, generalized convexity, analysis of ...
当当中国进口图书旗舰店在线销售正版《【预订】Nonlinear Programming: Analysis and Methods》。最新《【预订】Nonlinear Programming: Analysis and Methods》简介、书评、试读、价格、图片等相关信息,尽在DangDang.com,网购《【预订】Nonlinear Programming: Analysis
M. Avriel Nonlinear programming: analysis and methods. (1976) F.A. Lootsma Constrained optimization via parameter-free penalty functions Philips Research Reports (1968) R.W. Hornbeck Numerical methods (1975) There are more references available in the full text version of this article. ...
J.P. Aubin,Mathematical Methods of Game and Economic Theory (North-Holland, Amsterdam, 1979). Google Scholar M. Avriel,Nonlinear Programming: Analysis and Methods (Prentice-Hall, Englewood Cliffs, NJ, 1976). Google Scholar S.A. Awoniyi and M.J. Todd, “An efficient simplicial algorithm ...
Algorithms and their convergence, with a presentation of algorithms for solving both unconstrained and constrained nonlinear programming problems Important features of the Third Edition include: New topics such as second interior point methods, nonconvex optimization, nondifferentiable optimization, and more ...
We address some advantages of nonlinear programming (NLP)-based methods for inequality path-constrained optimal control problems. The analysis is carried out on the differential algebraic equation (DAE)-constrained optimization problem presented in [J. T. Betts and S. L. Campbell, Discretize Then Op...
nonlinear programmingNonlinear programming optimizes an objective function in the presence of equality and inequality constraints. In their treatment of convex analysis the authors cover convex sets and convex functions and generalizations. In the section on optimality conditions and duality they cover ...
(NLP) model and the notion of tangent cones in variational analysis is employed to establish the first-order optimality conditions for the NLP problem.The augmented Lagrange method is presented to solve this NLP problem and specific problems are solved by it.Numerical results show that the ...
Mixed IntegerNonlinear Programming(MINLP) is vastly employed in engineering practice, including thethermohydraulicdesign as shown in, for instance,Sections 2.2.1 and 2.2.4Section 2.2.1Section 2.2.4, where either thedensity change ofthe pin fin array in theparametric analysisor the trade-off between...
The methods for discrete-integer-continuous variable nonlinear optimization are reviewed. They are classified into the following six categories: branch and bound, simulated annealing, sequential linearization, penalty functions, Lagrangian relaxation, and other methods. Basic ideas of each method are describ...