All Areas Submissions - February 2013
Integer Programming
Quadratic Outer Approximation for Convex Integer Programming
Christoph Buchheim, Long Trieu
Applications — OR and Management Sciences
Shipping Data Generation for the Hunter Valley Coal Chain
N Boland, M Savelsbergh, H Waterer
Linear, Cone and Semidefinite Programming
Sparse Recovery on Euclidean Jordan Algebras
Lingchen Kong, Jie Sun, Jiyuan Tao, Naihua Xiu
Robust Optimization
Distributionally Robust Convex Optimization
Wolfram Wiesemann, Daniel Kuhn, Melvyn Sim
Linear, Cone and Semidefinite Programming
Extension of Completely Positive Cone Relaxation to Polynomial Optimization
Naohiko Arima, Sunyoung Kim, Masakazu Kojima
Linear, Cone and Semidefinite Programming
Extension of Completely Positive Cone Relaxation to Polynomial Optimization
Naohiko Arima, Sunyoung Kim, Masakazu Kojima
Nonlinear Optimization
Abstract Newtonian Frameworks and Their Applications
A.F. Izmailov, A.S. Kurennoy
Nonlinear Optimization
Attraction of Newton method to critical Lagrange multipliers: fully quadratic case
A.F. Izmailov, E.I. Uskov
Nonlinear Optimization
Strong local convergence properties of adaptive regularized methods for nonlinear least-squares
Stefania Bellavia, Benedetta Morini
Combinatorial Optimization
Equivalence of an Approximate Linear Programming Bound with the Held-Karp Bound for the Traveling Salesman Problem
Alejandro Toriello
Nonlinear Optimization
On the connection between the conjugate gradient method and quasi-Newton methods on quadratic problems
Anders Forsgren, Tove Odland
Complementarity and Variational Inequalities
A New Error Bound Result for Generalized Nash Equilibrium Problems and its Algorithmic Application
Axel Dreves, Francisco Facchinei, Andreas Fischer, Markus Herrich
Nonlinear Optimization
An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming
Atsushi Kato, Hiroshi Yabe, Hiroshi Yamashita
Integer Programming
Intersection Cuts for Nonlinear Integer Programming: Convexification Techniques for Structured Sets
Sina Modaresi, Mustafa Kilinc, Juan Pablo Vielma
Robust Optimization
Robust combinatorial optimization with cost uncertainty
Michael Poss
Applications — OR and Management Sciences
Decentralised Shared Resource Constraint Scheduling with Confidentiality Protection
Gaurav Singh, Christine O'Keefe
Applications — Science and Engineering
Gamma-Robust Facility Relocation Problem
Gino Lim, Ayse Sonmez
Integer Programming
Traveling Salesman Problem Formulations with $N \log N$ Number of Binary Variables
Thomas A. Pogiatzis, Vassilios S. Vassiliadis, Raul Conejeros
Linear, Cone and Semidefinite Programming
Strong duality in conic linear programming: facial reduction and extended duals
Gabor Pataki
Applications — OR and Management Sciences
A big-bucket time-indexed formulation for nonpreemptive single machine scheduling problems
Natashia Boland, Riley Clement, Hamish Waterer
Linear, Cone and Semidefinite Programming
Novel update techniques for the revised simplex method
Qi Huangfu, J. A. Julian Hall
Applications — OR and Management Sciences
Complexity of a classical flow restoration problem
Dritan Nace, Michal Pioro, Arthur Tomaszewski, Mateusz Zotkiewicz
Linear, Cone and Semidefinite Programming
Positive Semidefinite Matrix Completion, Universal Rigidity and the Strong Arnold Property
Monique Laurent, Antonios Varvitsiotis
Global Optimization
Analytical formulas for calculating the extremal ranks and inertias of $A + BXB^{*}$ when $X$ is a fixed-rank Hermitian matrix
Yongge Tian
Integer Programming
A New Class of Valid Inequalities for Nonlinear Network Design Problems
Armin Fügenschuh, Jesco Humpola
Applications — Science and Engineering
Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization
Nicolas Gillis, Robert Luce
Nonlinear Optimization
A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
Francesco Rinaldi, Luigi Grippo
Applications — Science and Engineering
Principle of optimal accuracy classification for metrological purposes
David Kisets
Integer Programming
On the Rank of Cutting-Plane Proof Systems
Sebastian Pokutta, Andreas S. Schulz
Nonlinear Optimization
A generalization of the Lowner-John's ellipsoid theorem
Jean B Lasserre
Other Topics
Lot Sizing with Piecewise Concave Production Costs
Esra Koca, Hande Yaman, M. Selim Akturk
Applications — OR and Management Sciences
Composite Retrieval of Diverse and Complementary Bundles
Sihem Amer-Yahia, Francesco Bonchi, Carlos Castillo, Esteban Feuerstein, Isabel Méndez-Díaz, Paula Zabala
Optimization Software and Modeling Systems
Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules
Illés Tibor, Nagy Adrienn
Combinatorial Optimization
A NOTE ON THE EXTENSION COMPLEXITY OF THE KNAPSACK POLYTOPE
Sebastian Pokutta, Mathieu Van Vyve
Other Topics
Optimal Power Grid Protection through A Defender-Attacker-Defender Model
Wei Yuan, Long Zhao, Bo Zeng
Linear, Cone and Semidefinite Programming
The Trust Region Subproblem with Non-Intersecting Linear Constraints
Samuel Burer, Boshi Yang
Integer Programming
Exact algorithms for the Traveling Salesman Problem with Draft Limits
Maria Battarra, Artur Alves Pessoa, Anand Subramanian, Eduardo Uchoa
Complementarity and Variational Inequalities
The s-Monotone Index Selection Rule for Criss-Cross Algorithms of Linear Complementarity Problems
Csizmadia Zsolt, Illés Tibor, Nagy Adrienn
Convex and Nonsmooth Optimization
Bundle methods in depth: a unified analysis for inexact oracles
Welington Oliveira, Claudia Sagastizábal, Claude Lemaréchal
Convex and Nonsmooth Optimization
An Augmented Lagrangian Method for Conic Convex Programming
Necdet Serhat Aybat, Garud Iyengar
Stochastic Programming
Risk-Averse Stochastic Dual Dynamic Programming
Václav Kozmík, David P. Morton
|