-

 

 

 




Optimization Online





 

All Areas Submissions - January 2011

Linear, Cone and Semidefinite Programming
Klee-Minty's LP and Upper Bounds for Dantzig's Simplex Method
Tomonari Kitahara, Shinji Mizuno

Combinatorial Optimization
Four new upper bounds for the stability number of a graph
Miklos Ujvari

Integer Programming
A Computational Study of Finitely Convergent Polyhedral Methods for General Mixed-Integer Linear Programs
Binyuan Chen, Dinakar Gade, Simge Kucukyavuz, Suvrajeet Sen

Convex and Nonsmooth Optimization
Target-following framework for symmetric cone programming
Chek Beng Chua

Applications — OR and Management Sciences
Approximate Dynamic Programming with Bezier Curves/Surfaces for Top-percentile traffic routing
Xinan Yang, Andreas Grothey

Stochastic Programming
Minimax and risk averse multistage stochastic programming
Alexander Shapiro

Applications — Science and Engineering
Global Stability Analysis of Fluid Flows using Sum-of-Squares
Paul Goulart, Sergei Chernyshenko

Combinatorial Optimization
A parametric active set method for quadratic programs with vanishing constraints
Christian Kirches, Andreas Potschka, Hans Georg Bock, Sebastian Sager

Global Optimization
On the relation between concavity cuts and the surrogate dual for convex maximization problems
Marco Locatelli, Fabio Schoen

Nonlinear Optimization
On the convergence of trust region algorithms for unconstrained minimization without derivatives
MJD Powell

Stochastic Programming
On the economic interpretation of time consistent dynamic stochastic programming problems
Birgit Rudloff, Alexandre Street, Davi Vallad„o

Nonlinear Optimization
An Iterative algorithm for large size Least-Squares constrained regularization problems.
Elena Loli Piccolomini, Zama Fabiana

Convex and Nonsmooth Optimization
Piecewise quadratic approximations in convex numerical optimization
Annabella Astorino, Antonio Frangioni, Manlio Gaudioso, Enrico Gorgone

Infinite Dimensional Optimization
Multiobjective DC Programming with Infinite Convex Constraints
Shaojian Qu, Mark Goh, Soonyi Wu

Integer Programming
Some Properties of Convex Hulls of Integer Points Contained in General Convex Sets
Santanu S. Dey, Diego A. Moran

Linear, Cone and Semidefinite Programming
A Bound for the Number of Different Basic Solutions Generated by the Simplex Method
Tomonari Kitahara, Shinji Mizuno

Applications — Science and Engineering
The iBP algorithm for the discretizable molecular distance geometry problem with interval data
Carlile Lavor, Leo Liberti, Antonio Mucherino

Linear, Cone and Semidefinite Programming
Epigraphical cones I
Alberto Seeger

Linear, Cone and Semidefinite Programming
Epigraphical cones II
Alberto Seeger

Convex and Nonsmooth Optimization
Error bounds for vector-valued functions: necessary and sufficient conditions
Ewa Bednarczuk, Alexander Kruger

Applications — OR and Management Sciences
Energy Savings in Wireless Mesh Networks in a Time-Variable Context
Antonio Capone, Filippo Malandra, Brunilde SansÚ

Combinatorial Optimization
New Bounds for Restricted Isometry Constants in Low-rank Matrix Recovery
Lingchen Kong, Naihua Xiu

Convex and Nonsmooth Optimization
On Implementing a Homogeneous Interior-Point Algorithm for Nonsymmetric Conic Optimization
Anders Skajaa, John Bagterp JÝrgensen, Per Christian Hansen

Convex and Nonsmooth Optimization
Double Smoothing Technique for Convex Optimization Problems in Hilbert Spaces with Applications to Optimal Control
Olivier Devolder, FranÁois Glineur, Yurii Nesterov

Linear, Cone and Semidefinite Programming
New developments in the primal-dual column generation technique
Jacek Gondzio, Pablo GonzŠlez-Brevis, Pedro Munari

Robust Optimization
Chance-Constrained Linear Matrix Inequalities with Dependent Perturbations: A Safe Tractable Approximation Approach
Sin-Shuen Cheung, Anthony Man-Cho So, Kuncheng Wang

Applications — Science and Engineering
Optimization-based search for Nordsieck methods of high order with quadratic stability
A. Cardone, Z. Jackiewicz, H. D. Mittelmann

Integer Programming
A Probing Algorithm for MINLP with Failure Prediction by SVM
Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff Linderoth, Francois Margot, Andreas Waechter

Convex and Nonsmooth Optimization
Convexity Conditions of Kantorovich Function and Related Semi-infinite Linear Matrix Inequalities
Yun-Bin Zhao

Linear, Cone and Semidefinite Programming
Approximation Theory of Matrix Rank Minimization and Its Application to Quadratic Equations
Yun-Bin Zhao

Integer Programming
CONVEX HULL RELAXATION (CHR) FOR CONVEX AND NONCONVEX MINLP PROBLEMS WITH LINEAR CONSTRAINTS
Aykut AhlatÁıoğlu, Monique Guignard

Integer Programming
A new, solvable, primal relaxation for convex nonlinear integer programming problems
Monique Guignard

Integer Programming
Combining QCR and CHR for Convex Quadratic MINLP Problems with Linear Constraints
Aykut AhlatÁıoğlu, Michael Bussieck, Mustafa Esen, Monique Guignard, Jan Jagla, Alexander Meeraus

Infinite Dimensional Optimization
Decision Rule Approximations for Continuous Linear Programs
Dimitra Bampou, Daniel Kuhn


  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