A sequential homotopy method for mathematical programming problems
From MaRDI portal
Abstract: We propose a sequential homotopy method for the solution of mathematical programming problems formulated in abstract Hilbert spaces under the Guignard constraint qualification. The method is equivalent to performing projected backward Euler timestepping on a projected gradient/antigradient flow of the augmented Lagrangian. The projected backward Euler equations can be interpreted as the necessary optimality conditions of a primal-dual proximal regularization of the original problem. The regularized problems are always feasible, satisfy a strong constraint qualification guaranteeing uniqueness of Lagrange multipliers, yield unique primal solutions provided that the stepsize is sufficiently small, and can be solved by a continuation in the stepsize. We show that equilibria of the projected gradient/antigradient flow and critical points of the optimization problem are identical, provide sufficient conditions for the existence of global flow solutions, and show that critical points with emanating descent curves cannot be asymptotically stable equilibria of the projected gradient/antigradient flow, practically eradicating convergence to saddle points and maxima. The sequential homotopy method can be used to globalize any locally convergent optimization method that can be used in a homotopy framework. We demonstrate its efficiency for a class of highly nonlinear and badly conditioned control constrained elliptic optimal control problems with a semismooth Newton approach for the regularized subproblems.
Recommendations
- scientific article; zbMATH DE number 4033509
- A sequential method for a class of stable mathematical programming problems
- Theory of globally convergent probability-one homotopies for nonlinear programming
- Publication:3476212
- Convergence theorems of homotopy method for constrained nonconvex programming
Cites work
- A direct method for parabolic PDE constrained optimization problems
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- A mesh-independence result for semismooth Newton methods.
- A modified Newton method for the solution of ill-conditioned systems of nonlinear equations with application to multiple shooting
- A nonsmooth version of Newton's method
- A note on solving nonlinear equations and the natural criterion function
- An affine covariant composite step method for optimization with PDEs as equality constraints
- Automated solution of differential equations by the finite element method. The FEniCS book
- Backward step control for global Newton-type methods
- Backward step control for Hilbert space problems
- Constrained optimization: Projected gradient flows
- Differential variational inequalities
- Direct multiple shooting for parabolic PDE constrained optimization
- DOLFIN: automated finite element computing
- Evaluating Derivatives
- Existence of solutions to projected differential equations in Hilbert spaces
- First- and second-order optimality conditions for a class of optimal control problems with quasilinear elliptic equations
- Flexible complementarity solvers for large-scale applications
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 3855514 (Why is no real title available?)
- scientific article; zbMATH DE number 3177945 (Why is no real title available?)
- scientific article; zbMATH DE number 1301768 (Why is no real title available?)
- scientific article; zbMATH DE number 940566 (Why is no real title available?)
- scientific article; zbMATH DE number 3441150 (Why is no real title available?)
- scientific article; zbMATH DE number 2104353 (Why is no real title available?)
- scientific article; zbMATH DE number 845550 (Why is no real title available?)
- scientific article; zbMATH DE number 851830 (Why is no real title available?)
- scientific article; zbMATH DE number 5937962 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3078897 (Why is no real title available?)
- Lagrange Multiplier Approach to Variational Problems and Applications
- Multilevel Algorithms for Constrained Compact Fixed Point Problems
- Newton--Picard Preconditioners for Time-Periodic Parabolic Optimal Control Problems
- Newton-Picard-based preconditioning for linear-quadratic optimization problems with time-periodic parabolic PDE constraints
- Nonconvex optimization: gradient flows and deformation
- On the role of natural level functions to achieve global convergence for damped Newton methods
- On the stable equilibrium points of gradient systems
- Ordinary differential equations. An introduction to nonlinear analysis. Transl. from the German by Gerhard Metzen
- Projected dynamical systems and evolutionary variational inequalities via Hilbert spaces with applications
- Projected gradient methods for linearly constrained problems
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Semismooth and Semiconvex Functions in Constrained Optimization
- Semismooth Newton Methods for Operator Equations in Function Spaces
- The grand four: affine invariant globalizations of Newton's method
- The Primal-Dual Active Set Method for Nonlinear Optimal Control Problems with Bilateral Constraints
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- The semismooth algorithm for large scale complementarity problems
- Unified form language: a domain-specific language for weak formulations of partial differential equations
Cited in
(3)
This page was built for publication: A sequential homotopy method for mathematical programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2020612)
