Pàgina inicial > Resultats de la cerca: Complementarity problem
  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.
33 p, 1.2 MB Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities / Kanzow, Christian ; Fukushima, Masao
The D-gap function, recently introduced by Peng and further studied by Yamashita et al. , allows a smooth unconstrained minimization reformulation of the general variational inequality problem. This paper is concerned with the D-gap function for variational inequality problems over a box or, equivalently, mixed complementarily problems. [...]
1998
Mathematical Programming, vol. 83 n. 1 (1998) p. 55-87  
 Accés restringit a la UAB
Registre complet -
2.
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 -
3.
9 p, 401.4 KB Equivalence of variational inequality problems to unconstrained minimization / Peng, Ji-Ming
In this paper we propose a class of merit functions for variational inequality problems (VI). Through these merit functions, the variational inequality problem is cast as unconstrained minimization problem. [...]
1997
Mathematical Programming, vol. 78 n. 3 (1997) p. 347-355  
 Accés restringit a la UAB
Registre complet -
4.
20 p, 1.1 MB Sensitivity analysis of composite piecewise smooth equations / Ralph, Daniel ; Scholtes, Stefan
This paper is a contribution to the sensitivity analysis of piecewise smooth equations. A piecewise smooth function is a Lipschitzian homeomorphism near a given point if and only if it is coherently oriented and has an invertible B-derivative at this point. [...]
1997
Mathematical Programming, vol. 76 n. 3 (1997) p. 593-612  
 Accés restringit a la UAB
Registre complet -
5.
20 p, 1.0 MB Solution of monotone complementarity problems with locally Lipschitzian functions / Fischer, Andreas
The paper deals with complementarity problems CP(F), where the underlying function F is assumed to be locally Lipschitzian. Based on a special equivalent reformulation of CP(F) as a system of equations (Phi)(x) = 0 or as the problem of minimizing the merit function (psi) =1/2 ^ 2_2, we extend results which hold for sufficiently smooth functions F to the nonsmooth case. [...]
1997
Mathematical Programming, vol. 76 n. 3 (1997) p. 513-532  
 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