Back to Results
First PageMeta Content
Convex optimization / Operations research / Subgradient method / Convex function / Conjugate gradient method / Lipschitz continuity / Subderivative / Mathematical optimization / Mathematical analysis / Convex analysis


Noname manuscript No. (will be inserted by the editor) An optimal subgradient algorithm with subspace search for costly convex optimization problems Masoud Ahookhosh · Arnold Neumaier
Add to Reading List

Document Date: 2015-04-01 13:26:40

Open Document

File Size: 274,81 KB

Share Result on Facebook

City

Vienna / /

Company

Ui / UPS / Mathematics Subject Classification (2000) 90C25 / Intel / /

/

Facility

University of Vienna / /

IndustryTerm

ε-solution / search schemes / multidimensional subspace search scheme / subspace search techniques / image processing / subspace search use / subgradient algorithms / subspace search / subgradient algorithm / line search techniques / matrix-vector products / line search / selected search directions / multidimensional subspace search / search directions / linear operator / multidimensional subspace search techniques / multidimensional subspace search technique / subspace search subproblem / subspace search schemes / /

Organization

University of Vienna / Faculty of Mathematics / /

Person

Arnold Neumaier Motivated / Masoud Ahookhosh / Ai / Arnold Neumaier / Arnold Neumaier Tseng / /

Position

editor / applying forward / /

Technology

LAN / RAM / subgradient algorithm / 4 end To implement Algorithm / machine learning / subgradient algorithms / image processing / /

URL

http /

SocialTag