default search action
Mathematical Programming, Volume 138
Volume 138, Numbers 1-2, April 2013
- Nan Kong, Andrew J. Schaefer
, Shabbir Ahmed
Totally unimodular stochastic programs. 1-13 - Peter W. Glynn, Gerd Infanger:
Simulation-based confidence bounds for two-stage stochastic programs. 15-42 - David Hartvigsen, Yanjun Li:
Polyhedron of triangle-free simple 2-matchings in subcubic graphs. 43-82 - Anton Schiela:
An interior point method in function space for the efficient solution of state constrained optimal control problems. 83-114 - Guanghui Lan, Renato D. C. Monteiro:
Iteration-complexity of first-order penalty methods for convex programming. 115-139 - Clóvis C. Gonzaga, Elizabeth W. Karas:
Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming. 141-166 - Vincent Guigues, Claudia A. Sagastizábal
Risk-averse feasible policies for large-scale multistage stochastic linear programs. 167-198 - Bernard Fortz
Stochastic binary problems with simple penalties for capacity constraints violations. 199-221 - Darinka Dentcheva, Maria Gabriela Martinez:
Regularization methods for optimization problems with probabilistic constraints. 223-251 - Burhaneddin Sandikçi
A hierarchy of bounds for stochastic mixed-integer programs. 253-272 - Sangho Shim, Ellis L. Johnson:
Cyclic group blocking polyhedra. 273-307 - Gemayqzel Bouza Allende, Georg Still:
Solving bilevel programs with the KKT-approach. 309-332 - Masakazu Kojima, Makoto Yamashita
Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization. 333-364 - Immanuel M. Bomze
Copositivity detection by difference-of-convex decomposition and ω-subdivision. 365-400 - J. William Helton, Igor Klep, Scott A. McCullough:
The matricial relaxation of a linear matrix inequality. 401-445 - Stephan Dempe
The bilevel programming problem: reformulations, constraint qualifications and optimality conditions. 447-473 - M. J. D. Powell:
Beyond symmetric Broyden for updating quadratic models in minimization without derivatives. 475-500 - Yu-Hong Dai:
A perfect example for the BFGS method. 501-530 - Mohit Tawarmalani
Explicit convex and concave envelopes through polyhedral subdivisions. 531-577 - Xiaojun Chen
Newton iterations in implicit time-stepping scheme for differential linear complementarity systems. 579-606
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.
last updated on 2025-04-14 00:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: