Mathematical programming

Mathematical programming 8 registres trobats  La cerca s'ha fet en 0.00 segons. 
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
2.
25 p, 1.0 MB A variable-penalty alternating directions method for convex optimization / Kontogiorgis, Spyridon ; Meyer, Robert R.
We study a generalized version of the method of alternating directions as applied to the minimization of the sum of two convex functions subject to linear constraints. The method consists of solving consecutively in each iteration two optimization problems which contain in the objective function both Lagrangian and proximal terms. [...]
1998
Mathematical Programming, vol. 83 n. 1 (1998) p. 29-53  
 Accés restringit a la UAB
3.
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
4.
12 p, 562.9 KB On proving existence of feasible points in equality constrained optimization problems / Kearfott, R. Baker
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for global optimizers and other contexts, it is of interest to construct bounds around such approximate feasible points, then to verify (computationally but rigorously) that an actual feasible point exists within these bounds. [...]
1998
Mathematical Programming, vol. 83 n. 1 (1998) p. 89-100  
 Accés restringit a la UAB
5.
11 p, 470.9 KB Plant location with minimum inventory / Barahona, Francisco ; Jensen, David
We present an integer programming model for plant location with inventory costs. The linear programming relaxation has been solved by Dantzig-Wolfe decomposition. In this case the subproblems reduce to the minimum cut problem. [...]
1998
Mathematical Programming, vol. 83 n. 1 (1998) p. 101-111  
 Accés restringit a la UAB
6.
11 p, 503.4 KB Approximate iterations in Bregman-function-based proximal algorithms / Eckstein, Jonathan
This paper establishes convergence of generalized Bregman-function-based proximal point algorithms when the iterates are computed only approximately. The problem being solved is modeled as a general maximal monotone operator, and need not reduce to minimization of a function. [...]
1998
Mathematical Programming, vol. 83 n. 1 (1998) p. 113-123  
 Accés restringit a la UAB
7.
19 p, 856.8 KB Warm start of the primal-dual method applied in the cutting-plane scheme / Gondzio, Jacek
A practical warm-start procedure is described for the infeasible primal-dual interior-point method (IPM) employed to solve the restricted master problem within the cutting-plane method. In contrast to the theoretical developments in this field, the approach presented in this paper does not make the unrealistic assumption that the new cuts are shallow. [...]
1998
Mathematical Programming, vol. 83 n. 1 (1998) p. 125-143  
 Accés restringit a la UAB
8.
14 p, 493.5 KB Generalized semi-infinite optimization : a first order optimality condition and examples / Jongen, H.Th. (RWTH Aachen. Department of Mathematics) ; Rückmann, J.-J. (University of Erlangen-Nürnberg. Institute of Applied Mathematics II) ; Stein, O. (RWTH Aachen. Department of Mathematics)
We consider a generalized semi-infinite optimization problem (GSIP) of the form (GSIP) min{f(x) $x (is in) M}, where M = {x (is in) R^nh_i(x) = 0, i = 1,. . . ,m, G(x, y) >= 0, y (is in) Y(x)} and all appearing functions are continuously differentiable. [...]
1998
Mathematical Programming, vol. 83 n. 1 (1998) p. 145-158  
 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.