|
Optimization Online Digest — February 2002
Applications — Science and Engineering
Large-Scale Linear Programming Techniques for the Design of Protein Folding Potentials
Michael Wagner, Jaroslaw Meller, Ron Elber
Convex and Nonsmooth Optimization
A new class of proximal interior-point methods for optimization under positivity constraints
Gilvan L. Oliveira, Paulo R. Oliveira
The method of reflection-projection for convex feasibility problems with an obtuse cone
Heinz Bauschke, Serge Kruk
Linear, Cone and Semidefinite Programming
Computational Experience and the Explanatory Value of Condition Numbers for Linear Optimization
Ordonez Fernando, Robert M. Freund
A new class of merit functions for the semidefinite complementarity problem
Rosely M. B. Goes, Paulo R. Oliveira
Nonlinear Optimization
Space mapping: Models, sensitivities, and trust-regions methods
Luis N. Vicente
A globally convergent primal-dual interior-point filter method for nonlinear programming
Michael Ulbrich, Stefan Ulbrich, Luis N. Vicente
Sparsity issues in the computation of Jacobian Matrices
Shahadat Hossain, Trond Steihaug
Optimization Software and Modeling Systems
Improved Interval Constraint Propagation for Constraints on Partial Derivatives
Evgueni Petrov, Frederic Benhamou
GloptiPoly - Global Optimization over Polynomials with
Matlab and SeDuMi
Didier Henrion, Jean B. Lasserre
Stochastic Programming
The Sample Average Approximation Method for Stochastic Programs with Integer Recourse
Shabbir Ahmed, Alexander Shapiro
|