<--- Back to Details
First PageDocument Content
Computer programming / Constraint programming / Operations research / Fortran / Local consistency / Constraint / Convex optimization / Mathematical optimization / Computing / Software engineering
Date: 2008-05-28 12:29:59
Computer programming
Constraint programming
Operations research
Fortran
Local consistency
Constraint
Convex optimization
Mathematical optimization
Computing
Software engineering

GlobSol-user-guide-for-GOMS-revision.dvi

Add to Reading List

Source URL: interval.louisiana.edu

Download Document from Source Website

File Size: 199,33 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

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