<--- Back to Details
First PageDocument Content
Mathematical analysis / Convex optimization / Linear programming / Convex analysis / Karush–Kuhn–Tucker conditions / Gradient method / Duality / Strong duality / Optimal design / Mathematical optimization / Numerical analysis / Operations research
Date: 2014-10-28 09:53:55
Mathematical analysis
Convex optimization
Linear programming
Convex analysis
Karush–Kuhn–Tucker conditions
Gradient method
Duality
Strong duality
Optimal design
Mathematical optimization
Numerical analysis
Operations research

Add to Reading List

Source URL: www.siam.org

Download Document from Source Website

File Size: 60,63 KB

Share Document on Facebook

Similar Documents

Singular Perturbations of Systems Controlled by Energy-Speed-Gradient Method

DocID: 1urGY - View Document

A Stochastic Gradient Method with an Exponential Convergence Rate for Finite Training Sets Nicolas Le Roux SIERRA Project-Team INRIA - ENS

DocID: 1u6wI - View Document

Adobe Technical Report, MarchA Perceptually Motivated Method to Control Reconstruction Errors in Gradient-based Image Compositing Sylvain Paris Abstract

DocID: 1tEfO - View Document

Steepest Descent Method Kefu Liu Properties of Gradient Vector The gradient vector of a scalar function f ( x1 , x2 ,", xn ) is defined as a column vector ⎡ ∂f

DocID: 1tbCd - View Document

SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives Francis Bach INRIA - Sierra Project-Team

DocID: 1sTsV - View Document