103 search results - page 7 / 21 » siamjo 2008 |
SIAMJO
2008
14 years 11 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
102
click to vote
SIAMJO
2008
14 years 10 months ago
2008
A class of trust-region algorithms is developed and analyzed for the solution of minimization problems with nonlinear inequality constraints. Based on composite-step trust region ...
SIAMJO
2008
14 years 11 months ago
2008
By considering the epigraphs of conjugate functions, we extend the Fenchel duality, applicable to a (possibly infinite) family of proper lower semicontinuous convex functions on a ...
SIAMJO
2008
14 years 11 months ago
2008
This paper extends the regularized smoothing Newton method in vector optimization to symmetric cone optimization, which provide a unified framework for dealing with the nonlinear ...
SIAMJO
2000
14 years 11 months ago
2000
The SQAP-polytope was associated to quadratic assignment problems with a certain symmetric objective function structure by Rijal (1995) and Padberg and Rijal (1996). We derive a te...