Articles

Articles 134 registres trobats  inicianterior124 - 133següent  anar al registre: La cerca s'ha fet en 0.03 segons. 
124.
22 p, 1.1 MB Free material optimization via mathematical programming / Zowe, Jochem ; Kocvara, Michal ; Bendsøe, Martin P.
This paper deals with a central question of structural optimization which is formulated as the problem of finding the stiffest structure which can be made when both the distribution of material as well as the material itself can be freely varied. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 445-466  
 Accés restringit a la UAB
125.
4 p, 171.0 KB A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming / Monteiro, Renato D.C. ; Zanjácomo, Paulo R.
This note establishes a new sufficient condition for the existence and uniqueness of the Alizadeh-Haeberly-Overton direction for semidefinite programming. .
1997
Mathematical Programming, vol. 78 n. 3 (1997) p. 393-396  
 Accés restringit a la UAB
126.
28 p, 1.1 MB The Projective Method for solving linear matrix inequalities / Gahinet, Pascal ; Nemirovski, Arkadi
Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. [...]
1997
Mathematical Programming, vol. 77 n. 2 (1997) p. 163-190  
 Accés restringit a la UAB
127.
34 p, 1.3 MB The long-step method of analytic centers for fractional problems / Nemirovski, A. (The Israel Institute of Technology)
We develop a long-step surface-following version of the method of analytic centers for the fractional-linear problem min {t_0 t_0B(x) - A(x) (is in) H,B (x) (is in) K, x (is in) G}, where H is a closed convex domain, K is a convex cone contained in the recessive cone of H, G is a convex domain and B(·), A(·) are affine mappings. [...]
1997
Mathematical Programming, vol. 77 n. 2 (1997) p. 191-224  
 Accés restringit a la UAB
128.
31 p, 1.3 MB Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems / Jansen, Benjamin ; Roos, Kees ; Terlaky, Tamás ; Yoshise, Akiko
This paper provides an analysis of the polynomiality of primal-dual interior point algorithms for nonlinear complementarity problems using a wide neighborhood. A condition for the smoothness of the mapping is used, which is related to Zhu's scaled Lipschitz condition, but is also applicable to mappings that are not monotone. [...]
1997
Mathematical Programming, vol. 78 n. 3 (1997) p. 315-345  
 Accés restringit a la UAB
129.
13 p, 551.2 KB On the worst case complexity of potential reduction algorithms for linear programming / Bertsimas, Dimitris ; Xiaodong, Luo
There are several classes of interior point algorithms that solve linear programming problems in O(V~nL) iterations. Among them, several potential reduction algorithms combine both theoretical (O(V~nL) iterations) and practical efficiency as they allow the flexibility of line searches in the potential function, and thus can lead to practical implementations. [...]
1997
Mathematical Programming, vol. 77 n. 3 (1997) p. 321-333  
 Accés restringit a la UAB
130.
20 p, 1021.2 KB A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems / Facchinei, Francisco ; Kanzow, Christian
A new algorithm for the solution of large-scale nonlinear complementarity problems is introduced. The algorithm is based on a nonsmooth equation reformulation of the complementarity problem and on an inexact Levenberg-Marquardt-type algorithm for its solution. [...]
1997
Mathematical Programming, vol. 76 n. 3 (1997) p. 493-512  
 Accés restringit a la UAB
131.
20 p, 827.4 KB Constraint aggregation principle in convex optimization / Ermoliev, Yuri M. ; Kryazhimskii, Arkadii V. ; Ruszczynski, Andrzej
A general constraint aggregation technique is proposed for convex optimization problems. At each iteration a set of convex inequalities and linear equations is replaced by a single surrogate inequality formed as a linear combination of the original constraints. [...]
1997
Mathematical Programming, vol. 76 n. 3 (1997) p. 353-372  
 Accés restringit a la UAB
132.
48 p, 1.8 MB Long-step strategies in interior-point primal-dual methods / Nesterov, Yu.
In this paper we analyze from a unique point of view the behavior of path-following and primal-dual potential reduction methods on nonlinear conic problems. We demonstrate that most interior-point methods with O(V~n ln(1/(Epsilon))) efficiency estimate can be considered as different strategies of minimizing a convex primal-dual potential function in an extended primal-dual space. [...]
1997
Mathematical Programming, vol. 76 n. 1 (1997) p. 47-94  
 Accés restringit a la UAB
133.
43 p, 2.2 MB Potential-reduction methods in mathematical programming / Todd, Michael J.
We provide a survey of interior-point methods for linear programming and its extensions that are based on reducing a suitable potential function at each iteration. We give a fairly complete overview of potential-reduction methods for linear programming, focusing on the possibility of taking long steps and the properties of the barrier function that are necessary for the analysis. [...]
1997
Mathematical Programming, vol. 76 n. 1 (1997) p. 3-45  
 Accés restringit a la UAB

Articles : 134 registres trobats   inicianterior124 - 133següent  anar al registre:
Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.