Resultats globals: 4 registres trobats en 0.02 segons.
Articles, 4 registres trobats
Articles 4 registres trobats  
1.
26 p, 1.3 MB A cone programming approach to the bilinear matrix inequality problem and its geometry / Mesbahi, Mehran ; Papavassilopoulos, George P.
We discuss an approach for solving the Bilinear Matrix Inequality (BMI) based on its connections with certain problems defined over matrix cones. These problems are, among others, the cone generalization of the linear programming (LP) and the linear complementarity problem (LCP) (referred to as the Cone-LP and the Cone-LCP, respectively). [...]
1997
Mathematical Programming, vol. 77 n. 2 (1997) p. 247-272  
 Accés restringit a la UAB
2.
24 p, 1.0 MB The largest step path following algorithm for monotone linear complementarity problems / Gonzaga, Clovis C.
Path-following algorithms take at each iteration a Newton step for approaching a point on the central path, in such a way that all the iterates remain in a given neighborhood of that path. This paper studies the case in which each iteration uses a pure Newton step with the largest possible reduction in complementarity measure (duality gap). [...]
1997
Mathematical Programming, vol. 76 n. 2 (1997) p. 309-332  
 Accés restringit a la UAB
3.
11 p, 495.3 KB On homogeneous and self-dual algorithms for LCP / Yinyu, Ye
We present some generalizations of a homogeneous and self-dual linear programming (LP) algorithm to solving the monotone linear complementarity problem (LCP). Again, while it achieves the best known interior-point iteration complexity, the algorithm does not need to use any "big-M" number, and it detects LCP infeasibility by generating a certificate. [...]
1997
Mathematical Programming, vol. 76 n. 1 (1997) p. 211-221  
 Accés restringit a la UAB
4.
21 p, 919.0 KB Fast convergence of the simplified largest step path following algorithm / Gonzaga, Clovis C. ; Bonnans, J. Frédéric
Each master iteration of a simplified Newton algorithm for solving a system of equations starts by computing the Jacobian matrix and then uses this matrix in the computation of p Newton steps: the first of these steps is exact, and the other are called "simplified". [...]
1997
Mathematical Programming, vol. 76 n. 1 (1997) p. 95-115  
 Accés restringit a la UAB

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.