✦ LIBER ✦

A dynamic gradient approach to Pareto optimization with nonsmooth convex objective functions

✍ Scribed by Attouch, Hédy; Garrigos, Guillaume; Goudou, Xavier

Book ID: 126277986
Publisher: Elsevier Science
Year: 2015
Tongue: English
Weight: 423 KB
Volume: 422
Category: Article
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2014.09.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Continuous Gradient-like Dynamical App

A Continuous Gradient-like Dynamical Approach to Pareto-Optimization in Hilbert Spaces

✍ Attouch, Hédy; Goudou, Xavier 📂 Article 📅 2013 🏛 Springer Netherlands 🌐 English ⚖ 548 KB

Dynamic optimization with a nonsmooth, n

Dynamic optimization with a nonsmooth, nonconvex technology: the case of a linear objective function

✍ Takashi Kamihigashi; Santanu Roy 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 179 KB

A robust optimization approach to diet p

A robust optimization approach to diet problem with overall glycemic load as objective function

✍ Bas, Esra 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 561 KB

A gradient-only line search method for t

A gradient-only line search method for the conjugate gradient method applied to constrained optimization problems with severe noise in the objective function

✍ J. A. Snyman 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

A new implementation of the conjugate gradient method is presented that economically overcomes the problem of severe numerical noise superimposed on an otherwise smooth underlying objective function of a constrained optimization problem. This is done by the use of a novel gradient-only line search t