Solving Convex Programs by Means of Ordinary Differential Equations

DOI10.1287/MOOR.17.2.290zbMath0764.90068OpenAlexW2039552580MaRDI QIDQ4016694

Sjur Didrik Flåm

Publication date: 16 January 1993

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.17.2.290

zbMATH Keywords

Hilbert spacesteepest descentabsolutely continuous trajectorydifferential inclusion of subgradient typenonsmooth convex programssharp constraints

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48) Ordinary differential inclusions (34A60) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

A continuous method for convex programming problems ⋮ A new super-memory gradient method with curve search rule ⋮ Dynamical systems and variational inequalities

This page was built for publication: Solving Convex Programs by Means of Ordinary Differential Equations