Narrow your search

Library

KU Leuven (24)

ULiège (21)

ULB (16)

Odisee (14)

Thomas More Kempen (14)

Thomas More Mechelen (14)

UCLL (14)

VIVES (14)

UGent (9)

UCLouvain (7)

More...

Resource type

book (24)


Language

English (22)

French (1)

German (1)


Year
From To Submit

2021 (2)

2020 (1)

2018 (1)

2016 (2)

2015 (2)

More...
Listing 1 - 10 of 24 << page
of 3
>>
Sort by
Topics in relaxation and ellipsoidal methods.
Author:
ISBN: 0273086340 Year: 1984 Publisher: Boston Pitman advanced publishing program

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
Interior-point polynomial algorithms in convex programming
Authors: ---
ISBN: 0898713196 9780898713190 Year: 1994 Volume: 13 Publisher: Philadelphia: Society for industrial and applied mathematics,

Theory of convex programming
Author:
ISBN: 0821815865 Year: 1972 Publisher: Providence, R.I.


Book
Grundlagen Konvexer Optimierung
Author:
ISBN: 3540080503 0387080503 9783540080503 Year: 1976 Volume: 137 Publisher: Berlin: Springer,


Book
Convex analysis : an introductory text
Author:
ISBN: 0471902659 0471902632 Year: 1984 Publisher: Chichester : John Wiley,


Book
Algorithms for convex optimization
Author:
ISBN: 1108699219 1108633994 1108757375 Year: 2021 Publisher: Cambridge : Cambridge University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

In the last few years, Algorithms for Convex Optimization have revolutionized algorithm design, both for discrete and continuous optimization problems. For problems like maximum flow, maximum matching, and submodular function minimization, the fastest algorithms involve essential methods such as gradient descent, mirror descent, interior point methods, and ellipsoid methods. The goal of this self-contained book is to enable researchers and professionals in computer science, data science, and machine learning to gain an in-depth understanding of these algorithms. The text emphasizes how to derive key algorithms for convex optimization from first principles and how to establish precise running time bounds. This modern text explains the success of these algorithms in problems of discrete optimization, as well as how these methods have significantly pushed the state of the art of convex optimization itself.


Book
Convexity and optimization in Banach spaces
Authors: ---
ISBN: 940072246X 9401782415 1283454246 9786613454249 9400722478 Year: 2012 Publisher: Dordrecht [Netherlands] : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

An updated and revised edition of the 1986 title Convexity and Optimization in Banach Spaces, this book provides a self-contained presentation of basic results of the theory of convex sets and functions in infinite-dimensional spaces. The main emphasis is on applications to convex optimization and convex optimal control problems in Banach spaces. A distinctive feature is a strong emphasis on the connection between theory and application. This edition has been updated to include new results pertaining to advanced concepts of subdifferential for convex functions and new duality results in convex programming. The last chapter, concerned with convex control problems, has been rewritten and completed with new research concerning boundary control systems, the dynamic programming equations in optimal control theory and periodic optimal control problems. Finally, the structure of the book has been modified to highlight the most recent progression in the field including fundamental results on the theory of infinite-dimensional convex analysis and includes helpful bibliographical notes at the end of each chapter.

Problèmes de minimax via l'analyse convexe et les inégalités variationnelles: : théorie et algorithmes
Author:
ISBN: 3540060790 0387060790 9783540060796 Year: 1972 Volume: 77 Publisher: Berlin: Springer,


Book
Convex optimization of power systems
Author:
ISBN: 9781107076877 1107076870 Year: 2015 Publisher: Cambridge: Cambridge university press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Optimization is ubiquitous in power system engineering. Drawing on powerful, modern tools from convex optimization, this rigorous exposition introduces essential techniques for formulating linear, second-order cone, and semidefinite programming approximations to the canonical optimal power flow problem, which lies at the heart of many different power system optimizations. Convex models in each optimization class are then developed in parallel for a variety of practical applications like unit commitment, generation and transmission planning, and nodal pricing. Presenting classical approximations and modern convex relaxations side-by-side, and a selection of problems and worked examples, this is an invaluable resource for students and researchers from industry and academia in power systems, optimization, and control.

Convexity and optimization in Banach spaces
Authors: ---
ISBN: 9027717613 9789027717610 Year: 1986 Publisher: Dordrecht: Reidel,

Listing 1 - 10 of 24 << page
of 3
>>
Sort by