<--- Back to Details
First PageDocument Content
Mathematics / Convex optimization / Mathematical optimization / Computational problems / Combinatorial optimization / Computational complexity theory / Combinatorics / Linear programming / Discrete mathematics / Operations research / Theoretical computer science / Applied mathematics
Date: 2015-05-19 21:11:47
Mathematics
Convex optimization
Mathematical optimization
Computational problems
Combinatorial optimization
Computational complexity theory
Combinatorics
Linear programming
Discrete mathematics
Operations research
Theoretical computer science
Applied mathematics

Susan Margulies margulie at usna dot edu United States Naval Academy, Department of Mathematics, Annapolis, MDResearch Interests Optimization, Graph Theory, Computer Algebra, Algorithms and Complexity, Quantum Com

Add to Reading List

Source URL: www.usna.edu

Download Document from Source Website

File Size: 142,23 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