<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Geometry / Convex optimization / Operations research / Linear programming / Polytopes / Unique sink orientation / LP-type problem / Orientation / Simplex / Ear decomposition
Date: 2016-06-20 11:55:09
Graph theory
Mathematics
Geometry
Convex optimization
Operations research
Linear programming
Polytopes
Unique sink orientation
LP-type problem
Orientation
Simplex
Ear decomposition

Unique Sink Orientations of Grids ? Bernd G¨artner1 , Walter D. Morris, Jr.2 , and Leo R¨ ust3

Add to Reading List

Source URL: people.inf.ethz.ch

Download Document from Source Website

File Size: 168,05 KB

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

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

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

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

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

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

DocID: 1v2Df - View Document