Feasible Direction Methods for Constrained Nonlinear Optimization: Suggestions for Improvements
2007 (English)Doctoral thesis, comprehensive summary (Other academic)
This thesis concerns the development of novel feasible direction type algorithms for constrained nonlinear optimization. The new algorithms are based upon enhancements of the search direction determination and the line search steps.
The Frank-Wolfe method is popular for solving certain structured linearly constrained nonlinear problems, although its rate of convergence is often poor. We develop improved Frank--Wolfe type algorithms based on conjugate directions. In the conjugate direction Frank-Wolfe method a line search is performed along a direction which is conjugate to the previous one with respect to the Hessian matrix of the objective. A further refinement of this method is derived by applying conjugation with respect to the last two directions, instead of only the last one.
The new methods are applied to the single-class user traffic equilibrium problem, the multi-class user traffic equilibrium problem under social marginal cost pricing, and the stochastic transportation problem. In a limited set of computational tests the algorithms turn out to be quite efficient. Additionally, a feasible direction method with multi-dimensional search for the stochastic transportation problem is developed.
We also derive a novel sequential linear programming algorithm for general constrained nonlinear optimization problems, with the intention of being able to attack problems with large numbers of variables and constraints. The algorithm is based on inner approximations of both the primal and the dual spaces, which yields a method combining column and constraint generation in the primal space.
Place, publisher, year, edition, pages
Matematiska institutionen , 2007. , 29 p.
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1095
constrained nonlinear optimization, feasible direction methods, conjugate directions, traffic equilibrium problem, sequential linear programming algorithm, stochastic transportation problem
IdentifiersURN: urn:nbn:se:liu:diva-8811ISBN: 978-91-85715-11-4OAI: oai:DiVA.org:liu-8811DiVA: diva2:23509
2007-05-25, Alan Turing, Hus E, Campus Valla, Linköping University, Linköping, 10:15 (English)
Forsgren, Anders, Professor
Göthe-Lundgren, MaudLarsson, TorbjörnRydergren, Clas
The articles are note published due to copyright rextrictions.2007-04-272007-04-272015-01-14
List of papers