Sciweavers

MP
2008
61views more  MP 2008»
13 years 11 months ago
How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
Abstract By refining a variant of the Klee
Antoine Deza, Eissa Nematollahi, Tamás Terl...
MP
2008
126views more  MP 2008»
13 years 11 months ago
Geometry of interpolation sets in derivative free optimization
We consider derivative free methods based on sampling approaches for nonlinear optimization problems where derivatives of the objective function are not available and cannot be dir...
Andrew R. Conn, Katya Scheinberg, Luís N. V...
MP
2008
92views more  MP 2008»
13 years 11 months ago
Invariance and efficiency of convex representations
We consider two notions for the representations of convex cones: G-representation and liftedG-representation. The former represents a convex cone as a slice of another; the latter...
Chek Beng Chua, Levent Tunçel
MP
2008
135views more  MP 2008»
13 years 11 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
MP
2008
50views more  MP 2008»
13 years 11 months ago
On some properties and an application of the logarithmic barrier method
Regina Sandra Burachik, L. Mauricio Graña D...
MP
2008
74views more  MP 2008»
13 years 11 months ago
On the symmetry function of a convex set
Abstract. We attempt a broad exploration of properties and connections between the symmetry function of a convex set S IRn and other arenas of convexity including convex functions...
Alexandre Belloni, Robert M. Freund
MP
2008
129views more  MP 2008»
13 years 11 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
MP
2008
115views more  MP 2008»
13 years 11 months ago
An efficient approach to updating simplex multipliers in the simplex algorithm
The simplex algorithm computes the simplex multipliers by solving a system (or two triangular systems) at each iteration. This note offers an efficient approach to updating the sim...
Jian-Feng Hu, Ping-Qi Pan