-

 

 

 




Optimization Online





 

All Areas Submissions - July 2008

Convex and Nonsmooth Optimization
Convexity in semi-algebraic geometry and polynomial optimization
Jean B. Lasserre

Nonlinear Optimization
Numerical Experience with a Recursive Trust-Region Method for Multilevel Nonlinear Optimization
Serge Gratton, Melodie Mouffe, Annick Sartenaer, Philippe L Toint, Dimitri Tomanos

Stochastic Programming
Scalable Heuristics for Stochastic Programming with Scenario Selection
Jean-Paul Watson, Roger J.-B. Wets, David L. Woodruff

Infinite Dimensional Optimization
Semi-infinite programming, duality, discretization and optimality conditions
Alexander Shapiro

Global Optimization
A stochastic algorithm for function minimization
SU DONGCAI, DONG JUNWEI, ZHENG ZUDUO

Global Optimization
On Non-Convex Quadratic Programming with Box Constraints
Samuel Burer, Adam Letchford

Integer Programming
Extended Formulations for Packing and Partitioning Orbitopes
Yuri Faenza, Volker Kaibel Kaibel

Convex and Nonsmooth Optimization
An infeasible interior-point algorithm with full Nesterov-Todd step for second-order cone programming
Liu Zhongyi

Combinatorial Optimization
Branch-and-Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
Ivan Contreras, Juan A. Díaz, Elena Fernández

Linear, Cone and Semidefinite Programming
A New Full-Newton step $O(n)$ Infeasible Interior-Point Algorithm for Semidefinite Optimization
Hossein Mansouri, Cornelis Roos

Linear, Cone and Semidefinite Programming
A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with $O(\sqrt{n}\log{\frac{{\rm Tr}(X^0S^0)}{\epsilon}})$ iteration complexity
Yang Li, Tamas Terlaky

Convex and Nonsmooth Optimization
Representation of nonnegative convex polynomials
Jean B. Lasserre

Convex and Nonsmooth Optimization
An Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semidefinite Programming
Zhongyi Liu

Combinatorial Optimization
GRASP: Advances and applications
Mauricio G. C. Resende, Celso C. Ribeiro

Combinatorial Optimization
GRASP
Mauricio G. C. Resende, Celso C. Ribeiro

Combinatorial Optimization
GRASP: Basic components and enhancements
Paola Festa, Mauricio G. C. Resende

Combinatorial Optimization
Hybrid GRASP heuristics
Paola Festa, Mauricio G. C. Resende

Robust Optimization
Asymmetry and Ambiguity in Newsvendor Models
Karthik Natarajan, Melvyn Sim, Joline Uichanco

Convex and Nonsmooth Optimization
A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration
Junfeng Yang, Wotao Yin, Yin Zhang, Yilun Wang

Combinatorial Optimization
Further results on knapsack tightening with guaranteed bounds
Daniel Bienstock

Applications — Science and Engineering
On fast integration to steady state and earlier times
Uri Ascher, Kees van den Doel, Hui Huang, Benar Svaiter

Robust Optimization
A note on the expected probability of constraint violation in sampled convex programs
Giuseppe Calafiore

Integer Programming
The Submodular Knapsack Polytope
Alper Atamturk, Vishnu Narayanan

Convex and Nonsmooth Optimization
Iteration-complexity of first-order penalty methods
Guanghui Lan, Renato Monteiro

Applications — OR and Management Sciences
Closed-form solutions to static-arbitrage upper bounds on basket options
Javier Pena, Juan Vera, Luis Zuluaga

Convex and Nonsmooth Optimization
A Full-Nesterov-Todd-Step Primal-Dual Infeasible Interior-Point Algorithm for Second-Order Cone Optimization
M. Zangiabadi, C. Roos

Stochastic Programming
Multi-stage Stochastic Linear Programming: An Approach by Events
C. Beltran-Royo, L. F. Escudero, R. E. Rodriguez-Ravines

Linear, Cone and Semidefinite Programming
An Infeasible Interior-Point Algorithm with full-Newton Step for Linear Optimization
H. Mansouri, M. Zangiabadi, Y. Bai, C. Roos

Applications — Science and Engineering
On Theory of Compressive Sensing via L1-Minimization:
YIn Zhang

Combinatorial Optimization
Nonlinear optimization for matroid intersection and extensions
Yael Berstein, Jon Lee, Shmuel Onn, Robert Weismantel

Integer Programming
Branching proofs of infeasibility in low density subset sum problems
Gabor Pataki, Mustafa Tural

Nonlinear Optimization
Group sparsity via linear-time projection
Ewout van den Berg, Mark Schmidt, Michael P. Friedlander, Kevin Murphy


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society