|
All Areas Submissions - December 2004
Convex and Nonsmooth Optimization
Finding optimal algorithmic parameters using a mesh adaptive direct search
Charles Audet, Dominique Orban
Applications — Science and Engineering
A Tabu Search Algorithm for Partitioning
Javier Trejos, Eduardo Piza, Alex Murillo
Convex and Nonsmooth Optimization
A Pattern Search Method for Discrete L_1 - Approximation
Claudio Bogani, Maria Grazia Gasparo, Alessandra Papini
Nonlinear Optimization
Using Sampling and Simplex Derivatives in Pattern Search Methods
A. L. Custódio, L. N. Vicente
Combinatorial Optimization
Parallel Greedy Randomized Adaptive Search Procedures
Mauricio G. C. Resende, Celso C. Ribeiro
Applications — Science and Engineering
Computational experience with an interior point algorithm for large scale contact problems
G. Tanoh, Y. Renard, D. Noll
Applications — Science and Engineering
Continuous optimization of beamlet intensities for photon and proton radiotherapy
R. Reemtsen, M. Alber
Linear, Cone and Semidefinite Programming
Magnetic Resonance Tissue Density Estimation using Optimal SSFP Pulse-Sequence Design
Christopher Anand, Renata Sotirov, Tamas Terlaky, Zhuo Zheng
Linear, Cone and Semidefinite Programming
A Fully Sparse Implementation of a Primal-Dual Interior-Point Potential Reduction Method for Semidefinite Programming
Gun Srijuntongsiri, Stephen Vavasis
Linear, Cone and Semidefinite Programming
Sums of Random Symmetric Matrices and Applications
Arkadi Nemirovski
Optimization Software and Modeling Systems
APPSPACK 4.0: Asynchronous Parallel Pattern Search for Derivative-Free Optimization
Genetha Gray, Tamara Kolda
Linear, Cone and Semidefinite Programming
Computational Experience with Rigorous Error Bounds
for the Netlib Linear Programming Library
Christian Keil, Christian Jansson
Nonlinear Optimization
Convergence Analysis of an Interior-Point Method for Mathematical Programs with Equilibrium Constraints
Arun Sen, David Shanno
Nonlinear Optimization
Steering Exact Penalty Methods
Byrd Richard, Nocedal Jorge, Waltz Richard
Convex and Nonsmooth Optimization
Online solution to convex finite minmax problems
Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico
Convex and Nonsmooth Optimization
Perturbations and metric regularity
A.L. Dontchev, A.S. Lewis
Combinatorial Optimization
Finding good nearly balanced cuts in power law graphs
Kevin Lang
Optimization Software and Modeling Systems
Exploiting Structure in Parallel Implementation of Interior Point Methods for Optimization
Jacek Gondzio, Andreas Grothey
Applications — OR and Management Sciences
Multi-Stage Stochastic Programming Models for Airline Revenue Management
Lijian Chen, Tito Homem-de-Mello
Nonlinear Optimization
Interior Methods for Mathematical Programs with Complementarity Constraints
Sven Leyffer, Gabriel Lopez-Calva, Jorge Nocedal
Integer Programming
Sequential pairing of mixed integer inequalities
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser
Integer Programming
Noncommercial Software for Mixed-Integer Linear Programming
Jeff Linderoth, Ted Ralphs
Integer Programming
Decomposition in Integer Programming
T.K. Ralphs, M.V. Galati
Linear, Cone and Semidefinite Programming
Lowner's Operator and Spectral Functions in Euclidean Jordan Algebras
D SUN, J SUN
Convex and Nonsmooth Optimization
Joint minimization with alternating Bregman proximity operators
H. H. Bauschke, P. L. Combettes, D. Noll
Convex and Nonsmooth Optimization
Set Intersection Theorems and Existence of Optimal Solutions
Dimitri Bertsekas, Paul Tseng
Robust Optimization
Convex Approximations of Chance Constrained Programs
Arkadi Nemirovski, Alexander Shapiro
Linear, Cone and Semidefinite Programming
How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds.
Antoine Deza, Eissa Nematollahi, Tamas Terlaky
|