A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
An Interior Points Method for Nonlinear Constrained Optimization
Abstract We describe a new general approach for interior points algorithms in nonlinear constrained optimization. It consists on the iterative solution, in the primal and dual variables, of Karush — Kuhn — Tucker first order optimality conditions. Based on this approach, different algorithms can be stated by taking advantage of the particular characteristics of the problem in consideration and of the order of the available information. This method is very strong and efficient, since at each iteration it only requires the solution of two linear systems with the same matrix. It is also particularly appropriated for Engineering Design Optimization, since feasible designs are obtained. We present a basic algorithm for inequality constrained problems and two of the possible particular versions. The first one is a first order algorithm and the second one uses a quasi — Newton approximation of the second derivative of the Lagrangian, in order to have superlinear asymptotic convergence. Equality constraints are introduced later.
An Interior Points Method for Nonlinear Constrained Optimization
Abstract We describe a new general approach for interior points algorithms in nonlinear constrained optimization. It consists on the iterative solution, in the primal and dual variables, of Karush — Kuhn — Tucker first order optimality conditions. Based on this approach, different algorithms can be stated by taking advantage of the particular characteristics of the problem in consideration and of the order of the available information. This method is very strong and efficient, since at each iteration it only requires the solution of two linear systems with the same matrix. It is also particularly appropriated for Engineering Design Optimization, since feasible designs are obtained. We present a basic algorithm for inequality constrained problems and two of the possible particular versions. The first one is a first order algorithm and the second one uses a quasi — Newton approximation of the second derivative of the Lagrangian, in order to have superlinear asymptotic convergence. Equality constraints are introduced later.
An Interior Points Method for Nonlinear Constrained Optimization
Herskovits, J. (author)
1993-01-01
20 pages
Article/Chapter (Book)
Electronic Resource
English
A nonlinear projection method for constrained optimization
| Taylor & Francis Verlag | 1984
Exact penalty in constrained optimization and critical points of Lipschitz functions
| British Library Online Contents | 2009
Interior points in the Erdős-Szekeres theorems
| British Library Online Contents | 2012
Lattice polygons with two interior lattice points
| British Library Online Contents | 2012
Building thermal model reduction using nonlinear constrained optimization
| Online Contents | 2002