Bewegte Bilder
Advances in convex optimization: conic programming
During the last two decades, major developments in convex optimization were focusing on conic programming, primarily, on linear, conic quadratic and semidefinite optimization. Conic programming allows to reveal rich structure which usually is possessed by a convex program and to exploit this structure in order to process the program efficiently. We overview the major components of the resulting theory (conic duality and primal-dual interior point polynomial time algorithms), outline the extremely rich expressive abilities of conic quadratic and semidefinite programming and discuss a number of instructive applications.
- Location
-
Hannover TIB
- Extent
-
94MB, 00:55:39:01 (unknown)
- Language
-
Englisch
- Notes
-
Audiovisuelles Material
- Bibliographic citation
-
International Congress of Mathematicians Madrid 2006 ; (Jan. 2006)
- Keyword
-
polynomial time algorithms
convex programming
semidefinite programming
duality
conic programming
- Event
-
Veröffentlichung
- (who)
-
Instituto de Ciencias Matemáticas (ICMAT)
- (when)
-
2006-01-01
- Contributor
-
Nemirovski, Arkadi
- DOI
-
10.5446/15969
- Last update
- 21.04.2026, 10:50 AM CEST
Data provider
This object is provided by:
Technische Informationsbibliothek (TIB).
If you have any questions about the object, please contact the data provider.
Object type
- zweidimensionales bewegtes Bild
Associated
- Nemirovski, Arkadi
- Instituto de Ciencias Matemáticas (ICMAT)
Time of origin
- 2006-01-01
Other Objects (12)
Advances in convex optimization: conic programming
Lagrangian Duality in Convex Conic Programming with Simple Proofs
Hessian barrier algorithms for non-convex conic optimization
COSMO: A Conic Operator Splitting Method for Convex Conic Problems
First order solutions in conic programming
A comparison of optimization solvers for log binomial regression including conic programming
Janowski type close-to-convex functions associated with conic regions
Convex Feasibility via Monotropic Programming
Convex Feasibility via Monotropic Programming
Decomposition of an integrally convex set into a Minkowski sum of bounded and conic integrally convex sets
Convex projection and convex multi-objective optimization
Recent advances in vector optimization and set-valued analysis via convex duality
Advances in convex optimization: conic programming
Lagrangian Duality in Convex Conic Programming with Simple Proofs
Hessian barrier algorithms for non-convex conic optimization
COSMO: A Conic Operator Splitting Method for Convex Conic Problems
First order solutions in conic programming
A comparison of optimization solvers for log binomial regression including conic programming
Janowski type close-to-convex functions associated with conic regions
Convex Feasibility via Monotropic Programming
Convex Feasibility via Monotropic Programming
Decomposition of an integrally convex set into a Minkowski sum of bounded and conic integrally convex sets
Convex projection and convex multi-objective optimization
Recent advances in vector optimization and set-valued analysis via convex duality
Advances in convex optimization: conic programming
Lagrangian Duality in Convex Conic Programming with Simple Proofs
Hessian barrier algorithms for non-convex conic optimization
COSMO: A Conic Operator Splitting Method for Convex Conic Problems
First order solutions in conic programming
A comparison of optimization solvers for log binomial regression including conic programming
Janowski type close-to-convex functions associated with conic regions
Convex Feasibility via Monotropic Programming
Convex Feasibility via Monotropic Programming
Decomposition of an integrally convex set into a Minkowski sum of bounded and conic integrally convex sets
Convex projection and convex multi-objective optimization