1,998 research outputs found
A second derivative SQP method: local convergence
In [19], we gave global convergence results for a second-derivative SQP method for minimizing the exact â„“1-merit function for a fixed value of the penalty parameter. To establish this result, we used the properties of the so-called Cauchy step, which was itself computed from the so-called predictor step. In addition, we allowed for the computation of a variety of (optional) SQP steps that were intended to improve the efficiency of the algorithm. \ud
\ud
Although we established global convergence of the algorithm, we did not discuss certain aspects that are critical when developing software capable of solving general optimization problems. In particular, we must have strategies for updating the penalty parameter and better techniques for defining the positive-definite matrix Bk used in computing the predictor step. In this paper we address both of these issues. We consider two techniques for defining the positive-definite matrix Bk—a simple diagonal approximation and a more sophisticated limited-memory BFGS update. We also analyze a strategy for updating the penalty paramter based on approximately minimizing the ℓ1-penalty function over a sequence of increasing values of the penalty parameter.\ud
\ud
Algorithms based on exact penalty functions have certain desirable properties. To be practical, however, these algorithms must be guaranteed to avoid the so-called Maratos effect. We show that a nonmonotone varient of our algorithm avoids this phenomenon and, therefore, results in asymptotically superlinear local convergence; this is verified by preliminary numerical results on the Hock and Shittkowski test set
A Method to Guarantee Local Convergence for Sequential Quadratic Programming with Poor Hessian Approximation
Sequential Quadratic Programming (SQP) is a powerful class of algorithms for
solving nonlinear optimization problems. Local convergence of SQP algorithms is
guaranteed when the Hessian approximation used in each Quadratic Programming
subproblem is close to the true Hessian. However, a good Hessian approximation
can be expensive to compute. Low cost Hessian approximations only guarantee
local convergence under some assumptions, which are not always satisfied in
practice. To address this problem, this paper proposes a simple method to
guarantee local convergence for SQP with poor Hessian approximation. The
effectiveness of the proposed algorithm is demonstrated in a numerical example
Combining Homotopy Methods and Numerical Optimal Control to Solve Motion Planning Problems
This paper presents a systematic approach for computing local solutions to
motion planning problems in non-convex environments using numerical optimal
control techniques. It extends the range of use of state-of-the-art numerical
optimal control tools to problem classes where these tools have previously not
been applicable. Today these problems are typically solved using motion
planners based on randomized or graph search. The general principle is to
define a homotopy that perturbs, or preferably relaxes, the original problem to
an easily solved problem. By combining a Sequential Quadratic Programming (SQP)
method with a homotopy approach that gradually transforms the problem from a
relaxed one to the original one, practically relevant locally optimal solutions
to the motion planning problem can be computed. The approach is demonstrated in
motion planning problems in challenging 2D and 3D environments, where the
presented method significantly outperforms a state-of-the-art open-source
optimizing sampled-based planner commonly used as benchmark
On Reduced Input-Output Dynamic Mode Decomposition
The identification of reduced-order models from high-dimensional data is a
challenging task, and even more so if the identified system should not only be
suitable for a certain data set, but generally approximate the input-output
behavior of the data source. In this work, we consider the input-output dynamic
mode decomposition method for system identification. We compare excitation
approaches for the data-driven identification process and describe an
optimization-based stabilization strategy for the identified systems
A Bayesian approach to constrained single- and multi-objective optimization
This article addresses the problem of derivative-free (single- or
multi-objective) optimization subject to multiple inequality constraints. Both
the objective and constraint functions are assumed to be smooth, non-linear and
expensive to evaluate. As a consequence, the number of evaluations that can be
used to carry out the optimization is very limited, as in complex industrial
design optimization problems. The method we propose to overcome this difficulty
has its roots in both the Bayesian and the multi-objective optimization
literatures. More specifically, an extended domination rule is used to handle
objectives and constraints in a unified way, and a corresponding expected
hyper-volume improvement sampling criterion is proposed. This new criterion is
naturally adapted to the search of a feasible point when none is available, and
reduces to existing Bayesian sampling criteria---the classical Expected
Improvement (EI) criterion and some of its constrained/multi-objective
extensions---as soon as at least one feasible point is available. The
calculation and optimization of the criterion are performed using Sequential
Monte Carlo techniques. In particular, an algorithm similar to the subset
simulation method, which is well known in the field of structural reliability,
is used to estimate the criterion. The method, which we call BMOO (for Bayesian
Multi-Objective Optimization), is compared to state-of-the-art algorithms for
single- and multi-objective constrained optimization
Estimation of constant and time-varying dynamic parameters of HIV infection in a nonlinear differential equation model
Modeling viral dynamics in HIV/AIDS studies has resulted in a deep
understanding of pathogenesis of HIV infection from which novel antiviral
treatment guidance and strategies have been derived. Viral dynamics models
based on nonlinear differential equations have been proposed and well developed
over the past few decades. However, it is quite challenging to use experimental
or clinical data to estimate the unknown parameters (both constant and
time-varying parameters) in complex nonlinear differential equation models.
Therefore, investigators usually fix some parameter values, from the literature
or by experience, to obtain only parameter estimates of interest from clinical
or experimental data. However, when such prior information is not available, it
is desirable to determine all the parameter estimates from data. In this paper
we intend to combine the newly developed approaches, a multi-stage
smoothing-based (MSSB) method and the spline-enhanced nonlinear least squares
(SNLS) approach, to estimate all HIV viral dynamic parameters in a nonlinear
differential equation model. In particular, to the best of our knowledge, this
is the first attempt to propose a comparatively thorough procedure, accounting
for both efficiency and accuracy, to rigorously estimate all key kinetic
parameters in a nonlinear differential equation model of HIV dynamics from
clinical data. These parameters include the proliferation rate and death rate
of uninfected HIV-targeted cells, the average number of virions produced by an
infected cell, and the infection rate which is related to the antiviral
treatment effect and is time-varying. To validate the estimation methods, we
verified the identifiability of the HIV viral dynamic model and performed
simulation studies.Comment: Published in at http://dx.doi.org/10.1214/09-AOAS290 the Annals of
Applied Statistics (http://www.imstat.org/aoas/) by the Institute of
Mathematical Statistics (http://www.imstat.org
- …