Global Convergence Of The Partitioned BFGS Algorithm For Convex Partially Separable Optimization.

Ph.L. Toint

Global Convergence Of The Partitioned BFGS Algorithm For Convex Partially Separable Optimization.

Résultats de recherche: Contribution à un journal/une revue › Article › Revue par des pairs

Résumé

Global convergence is proved for a partitioned BFGS algorithm, when applied on a partially separable problem with a convex decomposition. This case covers a known practical optimization method for large dimensional unconstrained problems. Inexact solution of the linear system defining the search direction and variants of the steplength rule are also shown to be acceptable without affecting the global convergence properties.

langue originale	Anglais
Pages (de - à)	290-306
Nombre de pages	17
journal	Mathematical Programming
Volume	36
Numéro de publication	3
Etat de la publication	Publié - 1 déc. 1986

Autres fichiers et liens

Link to publication in Scopus

1 Actif

ADALGOPT: ADALGOPT - Algorithmes avancés en optimisation non-linéaire
Sartenaer, A. & TOINT, P.
1/01/87 → …
Projet: Axe de recherche

Contient cette citation

@article{33061f42ab0d42c69456f371cd97392a,

title = "Global Convergence Of The Partitioned BFGS Algorithm For Convex Partially Separable Optimization.",

abstract = "Global convergence is proved for a partitioned BFGS algorithm, when applied on a partially separable problem with a convex decomposition. This case covers a known practical optimization method for large dimensional unconstrained problems. Inexact solution of the linear system defining the search direction and variants of the steplength rule are also shown to be acceptable without affecting the global convergence properties.",

author = "Ph.L. Toint",

year = "1986",

month = dec,

day = "1",

language = "English",

volume = "36",

pages = "290--306",

journal = "Mathematical Programming",

issn = "0025-5610",

publisher = "Springer-Verlag GmbH and Co. KG",

number = "3",

}

TY - JOUR

T1 - Global Convergence Of The Partitioned BFGS Algorithm For Convex Partially Separable Optimization.

AU - Toint, Ph.L.

PY - 1986/12/1

Y1 - 1986/12/1

N2 - Global convergence is proved for a partitioned BFGS algorithm, when applied on a partially separable problem with a convex decomposition. This case covers a known practical optimization method for large dimensional unconstrained problems. Inexact solution of the linear system defining the search direction and variants of the steplength rule are also shown to be acceptable without affecting the global convergence properties.

AB - Global convergence is proved for a partitioned BFGS algorithm, when applied on a partially separable problem with a convex decomposition. This case covers a known practical optimization method for large dimensional unconstrained problems. Inexact solution of the linear system defining the search direction and variants of the steplength rule are also shown to be acceptable without affecting the global convergence properties.

UR - http://www.scopus.com/inward/record.url?scp=0022914049&partnerID=8YFLogxK

M3 - Article

VL - 36

SP - 290

EP - 306

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 3

ER -

Global Convergence Of The Partitioned BFGS Algorithm For Convex Partially Separable Optimization.

Résumé

Autres fichiers et liens

Empreinte digitale

Projets

ADALGOPT: ADALGOPT - Algorithmes avancés en optimisation non-linéaire

Contient cette citation