Mon compte
Ma liste - 0
Catalogue
Ressources numériques
Nouveautés
Liens utiles
Mon compte
Recherche rapide
Recherche avancée
Recherche alphabétique
Historique
Information
Recherche
Auteur
Titre
Sujet
Titre de revue
Collection
Editeur
Note
Tous mots
ISBN
PPN
Modifier la recherche
>
CERGY
Elargir la recherche
Sur le même sujet :
Interior-point methods
Mathematical optimization.
MATHEMATICS -- Applied
Programming (Mathematics)
Algoritmen
Applied mathematics
Controleleer
Interior-point methods
Mathematical optimization.
Mathematics.
Mathematik
Mathematische programmering
Programming (Mathematics)
Zelfregulering
MATHEMATICS -- Optimization
Programmation (mathématiques)
Optimisation mathématique
Parcourir le catalogue
par auteur:
Terlaky , Tamas
Peng , Jiming
Roos , Cornelis , 1941-....
Rechercher sur Internet
Localiser dans une autre bibliothèque (SUDOC) (PPN ou ISBN ou ISSN)
Aperçu dans Google Books
Affichage MARC
Auteur :
Terlaky , Tamas
Titre :
Self-Regularity : A New Paradigm for Primal-Dual Interior-Point Algorithms , Tamás Terlaky ; Jiming Peng, Cornelis Roos
Editeur :
Princeton N.J , Princeton University Press -- 2002
ISBN:
978-1-400-82513-4
978-1-4008-2513-4
Notes :
La pagination de l'édition imprimée correspondante est de : 208 p.
Main description: Research on interior-point methods (IPMs) has dominated the field of mathematical programming for the last two decades. Two contrasting approaches in the analysis and implementation of IPMs are the so-called small-update and large-update methods, although, until now, there has been a notorious gap between the theory and practical performance of these two strategies. This book comes close to bridging that gap, presenting a new framework for the theory of primal-dual IPMs based on the notion of the self-regularity of a function. The authors deal with linear optimization, nonlinear complementarity problems, semidefinite optimization, and second-order conic optimization problems. The framework also covers large classes of linear complementarity problems and convex optimization. The algorithm considered can be interpreted as a path-following method or a potential reduction method. Starting from a primal-dual strictly feasible point, the algorithm chooses a search direction defined by some Newton-type system derived from the self-regular proximity. The iterate is then updated, with the iterates staying in a certain neighborhood of the central path until an approximate solution to the problem is found. By extensively exploring some intriguing properties of self-regular functions, the authors establish that the complexity of large-update IPMs can come arbitrarily close to the best known iteration bounds of IPMs. Researchers and postgraduate students in all areas of linear and nonlinear optimization will find this book an important and invaluable aid to their work
Nécessite un navigateur et un lecteur de fichier PDF
URL:
(Accès réservé aux étudiants de l'ENSEA)
http://univ.scholarvox.com.ez-proxy.ensea.fr/book/88838030
Sujet :
Interior-point methods
Mathematical optimization.
MATHEMATICS -- Applied
Programming (Mathematics)
Algoritmen
Applied mathematics
Controleleer
Interior-point methods
Mathematical optimization.
Mathematics.
Mathematik
Mathematische programmering
Programming (Mathematics)
Zelfregulering
MATHEMATICS -- Optimization
Programmation (mathématiques)
Optimisation mathématique
Exemplaires
Site
Emplacement
Cote
Type de prêt
Statut
Ensea
Ressources numériques
ENSEA-SCHOLARV
Consultation en ligne
Disponible
Pour toute question,
contactez la bibliothèque
Horizon Information Portal 3.25_france_v1m© 2001-2019
SirsiDynix
Tous droits réservés.