We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For strictly convex problems, the method reduces to the inexact sequential quadratic programming approach proposed by Byrd et al. [SIAM J. Optim. 19(1) 351–369, 2008]. For nonconvex problems, the methodology developed in this paper allows for the … Read more
A new method is introduced for solving equality constrained nonlinear optimization problems. This method does not use a penalty function, nor a barrier or a filter, and yet can be proved to be globally convergent to first-order stationary points. It uses different trust-regions to cope with the nonlinearities of the objective function and the constraints, … Read more
Metabolic networks are defined as the collection of biochemical reactions within a cell that define the functions of that cell. Due to the growing need to understand the functions of biological organisms for industrial and medical purposes, modeling and simulation of metabolic networks has attracted a lot of attention recently. Traditionally, metabolic networks are modeled … Read more
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that can ensure global convergence. Inexact SQP methods are needed for large-scale applications for which the iteration matrix cannot be explicitly formed or factored and the arising linear systems must be solved … Read more
We give a simple proof of the Maximum Principle for smooth hybrid control systems by reducing the hybrid problem to an optimal control problem of Pontryagin type and then by using the classical Pontryagin Maximum Principle. Citation A.V. Dmitruk, A.M. Kaganovich. The Hybrid Maximum Principle is a consequence of Pontryagin Maximum Principle, Systems & Control … Read more
We consider an implementation of the recursive multilevel trust-region algorithm proposed by Gratton, Sartenaer, Toint (2004), and provide significant numerical experience on multilevel test problems. A suitable choice of the algorithm’s parameters is identified on these problems, yielding a very satisfactory compromise between reliability and efficiency. The resulting default algorithm is then compared to alternative … Read more
This paper provides a detailed analysis of a primal-dual interior-point method for PDE-constrained optimization. Considered are optimal control problems with control constraints in $L^p$. It is shown that the developed primal-dual interior-point method converges globally and locally superlinearly. Not only the easier $L^\infty$-setting is analyzed, but also a more involved $L^q$-analysis, $q
Convergence properties of trust-region methods for unconstrained nonconvex optimization is considered in the case where information on the objective function’s local curvature is incomplete, in the sense that it may be restricted to a fixed set of “test directions” and may not be available at every iteration. It is shown that convergence to local “weak” … Read more
We consider the class of nonlinear optimal control problems with all data (differential equation, state and control constraints, cost) being polynomials. We provide a simple hierarchy of LMI-relaxations whose optimal values form a nondecreasing sequence of lower bounds on the optimal value. Preliminary results show that good approximations are obtained with few moments. Citation LAAS … Read more
We formulate an optimal control problem of magnetization in a ferromagnet as a mathematical program with evolutionary equilibrium constraints. The evolutionary nature of the equilibrium is due to the hysteresis behavior of the respective magnetization process. To solve the problem numerically, we adapted the implicit programming technique. The adjoint equations, needed to compute the subgradients … Read more