A New Steepest Descent Differential Inclusion-Based Method for Solving General Nonsmooth Convex Optimization Problems

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.159, Iss.3, 2013-12, pp. : 698-720

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A differential inclusion-based approach for solving nonsmooth convex optimization problems

By Hosseini Alireza

Optimization, Vol. 62, Iss. 9, 2013-09 ,pp. : 1203-1226

Taylor & Francis Ltd

Access to resources Recommend Favorite

On perturbed steepest descent methods with inexact line search for bilevel convex optimization

By Neto Elias Salomão Helou De Pierro Álvaro Rodolfo

Optimization, Vol. 60, Iss. 8-9, 2011-08 ,pp. : 991-1008

Taylor & Francis Ltd

Access to resources Recommend Favorite

The Origin of the Method of Steepest Descent

By Petrova S.S. Solov'ev A.D.

Historia Mathematica, Vol. 24, Iss. 4, 1997-11 ,pp. : 361-375

Academic Press

Access to resources Recommend Favorite

Solving quadratically constrained convex optimization problems with an interior-point method

By Mészáros Csaba

Optimization Methods and Software, Vol. 26, Iss. 3, 2011-06 ,pp. : 421-429

Taylor & Francis Ltd

Access to resources Recommend Favorite

Unconstrained Steepest Descent Method for Multicriteria Optimization on Riemannian Manifolds

By Bento G.

Journal of Optimization Theory and Applications, Vol. 154, Iss. 1, 2012-07 ,pp. : 88-107

Springer Publishing Company

Access to resources Recommend Favorite