<--- Back to Details
First PageDocument Content
Linear programming / Conic optimization / Quadratic programming / Ellipsoid method / Duality / Interior point method / Semidefinite programming / Criss-cross algorithm / Mathematical optimization / Operations research / Convex optimization
Date: 2013-07-04 08:43:04
Linear programming
Conic optimization
Quadratic programming
Ellipsoid method
Duality
Interior point method
Semidefinite programming
Criss-cross algorithm
Mathematical optimization
Operations research
Convex optimization

Add to Reading List

Source URL: www2.isye.gatech.edu

Download Document from Source Website

File Size: 4,75 MB

Share Document on Facebook

Similar Documents

ON THE LASSERRE HIERARCHY OF SEMIDEFINITE PROGRAMMING RELAXATIONS OF CONVEX POLYNOMIAL OPTIMIZATION PROBLEMS ETIENNE DE KLERK∗ AND MONIQUE LAURENT† Abstract. The Lasserre hierarchy of semidefinite programming approxi

DocID: 1vq1m - View Document

A Lower Bound for the Optimization of Finite Sums A. Optimization of a strongly convex smooth functions The most accessible derivation of this classic lower bound (Nesterov, 2004) relies on the simplifying assumption th

DocID: 1vmQl - View Document

Information Complexity of Black-Box Convex Optimization: A New Look Via Feedback Information Theory

DocID: 1vf1S - View Document

Embedded Convex Optimization with CVXPY Nicholas Moehle, Jacob Mattingley, Stephen Boyd Stanford University February 2018

DocID: 1va1o - View Document

Operator Splitting Methods for Convex Optimization Analysis and Implementation Goran Banjac St Edmund Hall

DocID: 1v2Df - View Document