Pàgina inicial > Resultats de la cerca: Linear complementarity
  Consells de cerca
Cerca avançada
Cerca col·leccions:
Ordena'ls per: Mostrar els resultats: Format de visualizació:
Resultats globals: 8 registres trobats en 0.02 segons.
Articles, 8 registres trobats
Articles 8 registres trobats  
1.
17 p, 563.6 KB Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity / Stoer, Josef ; Wechs, Martin
In this paper we study the behavior of infeasible-interior-point-paths for solving horizontal linear complementarity problems that are sufficient in the sense of Cottle et al. (R. W. Cottle, J. -S. [...]
1998
Mathematical Programming, vol. 83 n. 3 (1998) p. 407-423  
 Accés restringit a la UAB
Registre complet -
2.
22 p, 782.7 KB Predictor-corrector algorithm for solving P_* (k)-matrix LCP from arbitrary positive starting points / Potra, Florian A. ; Rongqin, Sheng
A new predictor-corrector algorithm is proposed for solving P_*(k)-matrix linear complementarity problems. If the problem is solvable, then the algorithm converges from an arbitrary positive starting point (x^0, s^0). [...]
1997
Mathematical Programming, vol. 76 n. 1 (1997) p. 223-244  
 Accés restringit a la UAB
Registre complet -
3.
27 p, 1.5 MB Criss-cross methods : A fresh view on pivot algorithms / Fukuda, Komei ; Terlaky, Tamás
Criss-cross methods are pivot algorithms that solve linear programming problems in one phase starting with any basic solution. The first finite criss-cross method was invented by Chang, Terlaky and Wang independently. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 369-395  
 Accés restringit a la UAB
Registre complet -
4.
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
Registre complet -
5.
10 p, 444.6 KB Pseudomonotone variational inequality problems : Existence of solutions / Crouzeix, Jean-Pierre
Necessary and sufficient conditions for the set of solutions of a pseudomonotone variational inequality problem to be nonempty and compact are given. .
1997
Mathematical Programming, vol. 78 n. 3 (1997) p. 305-314  
 Accés restringit a la UAB
Registre complet -
6.
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
Registre complet -
7.
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
Registre complet -
8.
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
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