Pàgina inicial > Resultats de la cerca: Convex feasibility
  Consells de cerca
Cerca avançada
Cerca col·leccions:
Ordena'ls per: Mostrar els resultats: Format de visualizació:
Resultats globals: 2 registres trobats en 0.02 segons.
Articles, 2 registres trobats
Articles 2 registres trobats  
1.
20 p, 569.1 KB Complexity analysis of the analytic center cutting plane method that uses multiple cuts / Ye, Yinyu
We analyze the complexity of the analytic center cutting plane or column generation algorithm for solving general convex problems defined by a separation oracle. The oracle is called at the analytic center of a polytope, which contains a solution set and is given by the intersection of the linear inequalities previously generated from the oracle. [...]
1997
Mathematical Programming, vol. 78 n. 1 (1997) p. 85-104  
 Accés restringit a la UAB
Registre complet -
2.
21 p, 759.1 KB Two generalizations of Dykstra's cyclic projections algorithm / Hundal, Hein ; Deutsch, Frank
Dykstra's cyclic projections algorithm allows one to compute best approximations to any pointx in a Hilbert space from the intersection C = (intersection)^r_1 C_i of a finite number of closed convex sets C_i, by reducing it to a sequence of best approximation problems from the individual sets C_i. [...]
1997
Mathematical Programming, vol. 77 n. 3 (1997) p. 335-355  
 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