Sciweavers

225 search results - page 2 / 45
» Approximating Parameterized Convex Optimization Problems
Sort
View
ALGORITHMICA
2006
93views more  ALGORITHMICA 2006»
13 years 5 months ago
Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs
For multi-criteria problems and problems with poorly characterized objective, it is often desirable to simultaneously approximate the optimum solution for a large class of objecti...
Ashish Goel, Adam Meyerson
MP
2010
162views more  MP 2010»
13 years 3 months ago
Approximation accuracy, gradient methods, and error bound for structured convex optimization
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...
Paul Tseng
SIAMJO
2000
88views more  SIAMJO 2000»
13 years 5 months ago
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
Paul Armand, Jean Charles Gilbert, Sophie Jan-J&ea...
CDC
2008
IEEE
150views Control Systems» more  CDC 2008»
13 years 12 months ago
Subgradient methods and consensus algorithms for solving convex optimization problems
— In this paper we propose a subgradient method for solving coupled optimization problems in a distributed way given restrictions on the communication topology. The iterative pro...
Björn Johansson, Tamás Keviczky, Mikae...
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
13 years 13 days ago
Robust controller design by convex optimization based on finite frequency samples of spectral models
Abstract-- Some frequency-domain controller design problems are solved using a finite number of frequency samples. Consequently, the performance and stability conditions are not gu...
Gorka Galdos, Alireza Karimi, Roland Longchamp