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

Author： Neto Elias Salomão Helou   De Pierro Álvaro Rodolfo  

Publisher： Taylor & Francis Ltd

ISSN： 0233-1934

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

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

An Inexact Steepest Descent Method for Multicriteria Optimization on Riemannian Manifolds

By Bento G.   Cruz Neto J.   Santos P.  

Journal of Optimization Theory and Applications, Vol. 159, Iss. 1, 2013-10 ,pp. : 108-124

Springer Publishing Company

Access to resources Recommend Favorite

New Inexact Line Search Method for Unconstrained Optimization

By Shi Z.   Shen J.  

Journal of Optimization Theory and Applications, Vol. 127, Iss. 2, 2005-11 ,pp. : 425-446

Springer Publishing Company

Access to resources Recommend Favorite

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

By Hosseini Alireza   Hosseini S.  

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

Springer Publishing Company

Access to resources Recommend Favorite

On steepest descent curves for quasi convex families in Rn

By  

MATHEMATISCHE NACHRICHTEN, Vol. 288, Iss. 4, 2015-03 ,pp. : 420-442

John Wiley & Sons Inc

Access to resources Recommend Favorite

Accelerated gradient descent methods with line search

By Stanimirović Predrag   Miladinović Marko  

Numerical Algorithms, Vol. 54, Iss. 4, 2010-08 ,pp. : 503-520

Springer Publishing Company

Access to resources Recommend Favorite