default search action
Mathematical Programming, Volume 111
Volume 111, Numbers 1-2, January 2008
- Kurt M. Anstreicher, Alfredo N. Iusem:
Continuous optimization: 5th Brazilian workshop. 1-4 - Roberto Andreani, Ernesto G. Birgin, José Mario Martínez, María Laura Schuverdt:
Augmented Lagrangian methods under the constant positive linear dependence constraint qualification. 5-32 - Jean-Bernard Baillon, Roberto Cominetti:
Markovian traffic equilibrium. 33-56 - Alexandre Belloni, Robert M. Freund:
On the symmetry function of a convex set. 57-93 - Regina Sandra Burachik, L. Mauricio Graña Drummond, Susana Scheimberg:
On some properties and an application of the logarithmic barrier method. 95-112 - Chek Beng Chua, Levent Tunçel:
Invariance and efficiency of convex representations. 113-140 - Andrew R. Conn, Katya Scheinberg, Luís Nunes Vicente:
Geometry of interpolation sets in derivative free optimization. 141-172 - Jonathan Eckstein, Benar Fux Svaiter:
A family of projective splitting methods for the sum of two maximal monotone operators. 173-199 - L. Mauricio Graña Drummond, Nelson Maculan, Benar Fux Svaiter:
On the choice of parameters for the weighting method in vector optimization. 201-216 - Alfredo N. Iusem, Alberto Seeger:
Computing the radius of pointedness of a convex cone. 217-241 - Florian A. Potra:
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path. 243-272 - Hugo D. Scolnik, Nélida E. Echebest, M. T. Guardarucci, M. C. Vacchino:
Incomplete oblique projections for solving large inconsistent linear systems. 273-300 - Michael J. Todd:
Dual versus primal-dual interior-point methods for linear and conic programming. 301-313 - Yinyu Ye:
A path to the Arrow-Debreu competitive market equilibrium. 315-348
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.