<--- Back to Details
First PageDocument Content
Mathematical optimization / Subgradient method / Subderivative / Gradient descent / Relaxation / Cutting-plane method / Convex optimization
Date: 2012-07-25 10:25:10
Mathematical optimization
Subgradient method
Subderivative
Gradient descent
Relaxation
Cutting-plane method
Convex optimization

277 Documenta Math. Subgradient Optimization in Nonsmooth Optimization

Add to Reading List

Source URL: documenta.sagemath.org

Download Document from Source Website

File Size: 172,22 KB

Share Document on Facebook

Similar Documents

IMPLEMENTATION OF A CUTTING PLANE METHOD FOR SEMIDEFINITE PROGRAMMING by Joseph G. Young

DocID: 1tPuJ - View Document

Mathematics / Operations research / Mathematical optimization / Numerical analysis / Linear programming / Fellows of the Econometric Society / Mathematical economists / George Dantzig / Mathematical economics / Simplex algorithm / Cutting-plane method / John von Neumann

PDF Document

DocID: 1q42m - View Document

Operations research / Combinatorial optimization / Travelling salesman problem / Branch and bound / Linear programming relaxation / Integer programming / Branch and cut / Linear programming / Algorithm / Mathematical optimization / Cutting-plane method / Simplex algorithm

227 Documenta Math. Markowitz and Manne + Eastman + Land and Doig = Branch and Bound

DocID: 1p8DV - View Document

Mathematical optimization / Subgradient method / Subderivative / Gradient descent / Relaxation / Cutting-plane method / Convex optimization

277 Documenta Math. Subgradient Optimization in Nonsmooth Optimization

DocID: 1oUrq - View Document

Logic / Mathematical logic / Abstraction / Automated theorem proving / Model theory / Predicate logic / Semantics / Boolean algebra / Resolution / Cutting-plane method / First-order logic / Propositional calculus

First-Order Mixed Integer Linear Programming Geoffrey J. Gordon Machine Learning Department Carnegie Mellon University Pittsburgh, PA 15213

DocID: 1nwjJ - View Document