Pàgina inicial > Resultats de la cerca: Interior-point methods
  Consells de cerca
Cerca avançada
Cerca col·leccions:
Ordena'ls per: Mostrar els resultats: Format de visualizació:
Resultats globals: 6 registres trobats en 0.05 segons.
Articles, 6 registres trobats
Articles 6 registres trobats  
1.
28 p, 1.1 MB Condition measures and properties of the central trajectory of a linear program / Nunez, Manuel A. (Chapman University (Orange, Estats Units d'Amèrica). School of Business and Economics) ; Freund, Robert M. (Sloan School of Management)
Given a data instance d = (A, b, c) of a linear program, we show that certain properties of solutions along the central trajectory of the linear program are inherently related to the condition number C(d) of the data instance d = (A, b, c), where C(d) is a scale-invariant reciprocal of a closely-related measure (rho)(d) called the "distance to ill-posedness". [...]
1998
Mathematical Programming, vol. 83 n. 1 (1998) p. 1-28  
 Accés restringit a la UAB
Registre complet -
2.
19 p, 807.5 KB Exploiting sparsity in primal-dual interior-point methods for semidefinite programming / Fujisawa, Katsuki ; Kojima, Masakazu ; Nakata, Kazuhide
The Helmberg-Rendl-Vanderbei-Wolkowicz/Kojima-Shindoh-Hara/Monteiro and Nesterov-Todd search directions have been used in many primal-dual interior-point methods for semidefinite programs. This paper proposes an efficient method for computing the two directions when the semidefinite program to be solved is large scale and sparse. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 235-253  
 Accés restringit a la UAB
Registre complet -
3.
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
Registre complet -
4.
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
Registre complet -
5.
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
Registre complet -
6.
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
Registre complet -

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.
Dipòsit Digital de Documents de la UAB :: Cerca :: Lliura :: Personalitza :: Ajuda
Powered by Invenio v1.1.6
Mantingut per ddd.bib@uab.cat  :: Metadades subjectes a:
Col·laborem