Sciweavers

4 search results - page 1 / 1
» Analytic centers and repelling inequalities
Sort
View
EOR
2002
89views more  EOR 2002»
13 years 4 months ago
Analytic centers and repelling inequalities
ct 9 The new concepts of repelling inequalities, repelling paths, and prime analytic centers are introduced. A repelling 10 path is a generalization of the analytic central path fo...
Richard J. Caron, Harvey J. Greenberg, Allen G. Ho...
AUTOMATICA
2007
72views more  AUTOMATICA 2007»
13 years 4 months ago
A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
ust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F . = {f (x,...
Giuseppe C. Calafiore, Fabrizio Dabbene
SIAMJO
2000
88views more  SIAMJO 2000»
13 years 4 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...
COLT
2004
Springer
13 years 10 months ago
Statistical Properties of Kernel Principal Component Analysis
The main goal of this paper is to prove inequalities on the reconstruction error for Kernel Principal Component Analysis. With respect to previous work on this topic, our contribu...
Laurent Zwald, Olivier Bousquet, Gilles Blanchard