A dynamical systems approach to constrained minimization

DOI10.1080/01630560008816971zbMath1017.90106OpenAlexW2073819585MaRDI QIDQ4508650

Johannes Schropp

Publication date: 25 June 2001

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-20597

zbMATH Keywords

minimization problemssequential quadratic programmingordinary differential equationsdifferential algebraic equations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Implicit ordinary differential equations, differential-algebraic equations (34A09) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06)

Related Items (13)

Continuation methods with the trusty time-stepping scheme for linearly constrained optimization with noisy data ⋮ An \(O(s^r)\)-resolution ODE framework for understanding discrete-time algorithms and applications to the linear convergence of minimax problems ⋮ The regularization continuation method with an adaptive time step control for linearly constrained optimization problems ⋮ Proximal gradient flow and Douglas-Rachford splitting dynamics: global exponential stability via integral quadratic constraints ⋮ A locally convergent continuous-time algorithm to find all the roots of a time-varying polynomial ⋮ A variational formulation for computing shape derivatives of geometric constraints along rays ⋮ The regularization continuation method for optimization problems with nonlinear equality constraints ⋮ Unnamed Item ⋮ Constrained optimization: Projected gradient flows ⋮ Null space gradient flows for constrained optimization with applications to shape optimization ⋮ One- and multistep discretizations of index 2 differential algebraic systems and their use in optimization ⋮ Attracting sets in index 2 differential algebraic equations and in their Runge-Kutta discretizations ⋮ Behavior of Runge-Kutta discretizations near equilibria of index 2 differential algebraic systems

Cites Work

• Unnamed Item
• The Distance to the Intersection of Two Convex Sets Expressed by the Distances to Each of Them
• On Projection Algorithms for Solving Convex Feasibility Problems
• Best approximation by normal and conormal sets

This page was built for publication: A dynamical systems approach to constrained minimization