All Areas Submissions  June 2007
Linear, Cone and Semidefinite Programming
A polynomial predictorcorrector trustregion algorithm for linear programming
Guanghui Lan, Renato Monteiro, Takashi Tsuchiya
Global Optimization
A novel hybrid algorithm with marriage of particle swarm optimization and extremal optimization
Chen MinRong, Lu YongZai, Luo Qi
Applications — Science and Engineering
Graph Modeling for Quadratic Assignment Problem Associated with the Hypercube
jiming peng, Hans Mittelmann, Xiaolin Wu
Complementarity and Variational Inequalities
An Algorithm for the Fast Solution of Linear Complementarity Problems
Jose Luis Morales, Jorge Nocedal, Mikhail Smelyanskiy
Nonlinear Optimization
An implicit trustregion method on Riemannian manifolds
C. G. Baker, P.A. Absil, K. A. Gallivan
Integer Programming
Separation Algorithms for 01 Knapsack Polytopes
Konstantinos Kaparis, Adam Letchford
Integer Programming
Improving a Formulation of the Quadratic Knapsack Problem
Daniel Grainger, Adam Letchford
Combinatorial Optimization
On the strength of cutbased inequalities for capacitated network design polyhedra
Christian Raack, Arie M.C.A. Koster, Roland Wessäly
Nonlinear Optimization
A view of algorithms for optimization without derivatives
M.J.D. Powell
Convex and Nonsmooth Optimization
Necessary optimality condition for Nonsmooth Switching Control problem
Shahlar Maharramov
Applications — OR and Management Sciences
Satisficing measures for analysis of risky positions
David B. Brown, Melvyn Sim
Applications — OR and Management Sciences
A MIP Approach for some Practical Packing Problems: Balancing Constraints and Tetrislike Items
giorgio fasano
Linear, Cone and Semidefinite Programming
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
Etienne De Klerk, Renata Sotirov
Nonlinear Optimization
Convergence Analysis of an InteriorPoint Method for Nonconvex Nonlinear Programming
Hande Y. Benson, Arun Sen, David F. Shanno
Applications — OR and Management Sciences
MIPbased heuristic for nonstandard 3Dpacking problems
Giorgio Fasano
Complementarity and Variational Inequalities
An iterative approach for cone complementarity problems for nonsmooth multibody dynamics
Mihai Anitescu, Alessandro Tasora
Combinatorial Optimization
Expressing Combinatorial Optimization Problems by Systems of Polynomial Equations and the Nullstellensatz
Jesus De Loera, Jon Lee, Susan Margulies, Shmuel Onn
Nonlinear Optimization
Developments of NEWUOA for unconstrained minimization without derivatives
M.J.D. Powell
Combinatorial Optimization
Minimum weight tcomposition of an integer
Domingos M. Cardoso, J. Orestes Cerdeira
Nonlinear Optimization
A globally convergent trustregion SQP method without a penalty function for nonlinearly constrained optimization
Hiroshi Yamashita, Hiroshi Yabe
Nonlinear Optimization
A primaldual interior point method for nonlinear semidefinite programming
Hiroshi Yamashita, Hiroshi Yabe, Kouhei Harada
Linear, Cone and Semidefinite Programming
Semidefinite Representation of Convex Sets
J. William Helton, Jiawang Nie
Applications — OR and Management Sciences
A new lower bound for onemachine earlinesstardiness scheduling
Francis Sourd
Global Optimization
A Filled Function Method with One Parameter for $R^n$ Constrained Global Optimization
wang weixiang, shang youlin, zhang liansheng
Combinatorial Optimization
Tractable algorithms for chanceconstrained combinatorial problems
Olivier Klopfenstein
Integer Programming
Conic MixedInteger Rounding Cuts
Alper Atamturk, Vishnu Narayanan
Integer Programming
A strong conic quadratic reformulation for machinejob assignment with controllable processing times
Selim M. Akturk, Alper Atamturk, Sinan Gurel
Integer Programming
The Flow Set with Partial Order
Alper Atamturk, Muhong Zhang
Combinatorial Optimization
New Lower Bounds on the Stability Number of a Graph
E. Alper YILDIRIM
Integer Programming
Column basis reduction and decomposable knapsack problems
Bala Krishnamoorthy, Gabor Pataki
Linear, Cone and Semidefinite Programming
Symmetry in semidefinite programs
Frank Vallentin
Robust Optimization
Explicit reformulations for robust optimization problems with general uncertainty sets
Igor Averbakh, YunBin Zhao
Applications — Science and Engineering
Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems
M. A. T. Figueiredo, R. D. Nowak, S. J. Wright
Applications — OR and Management Sciences
Partition Inequalities for Capacitated Survivable Network Design Based on Directed PCycles
Alper Atamturk, Deepak Rajan
Applications — OR and Management Sciences
An O(n^2) Algorithm for Lot Sizing with Inventory Bounds and Fixed Costs
Alper Atamturk, Simge Kucukyavuz
Convex and Nonsmooth Optimization
Guaranteed MinimumRank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Benjamin Recht, Maryam Fazel, Pablo A. Parrilo
Convex and Nonsmooth Optimization
In pursuit of a root
Ewout van den Berg, Michael P Friedlander
Global Optimization
Maxmin separability: incremental approach and application to supervised data classification
Adil M Bagirov, Dean Webb, Bulent Karasozen
Convex and Nonsmooth Optimization
Smooth Optimization Approach for Covariance Selection
Zhaosong Lu
