All Areas Submissions - September 2013
Nonlinear Optimization
String-Averaging Projected Subgradient Methods for Constrained Minimization
Yair Censor, Alexander J. Zaslavski
Nonlinear Optimization
The Euclidean distance degree of an algebraic variety
Jan Draisma, Emil Horobet, Giorgio Ottaviani, Bernd Sturmfels, Rekha R. Thomas
Linear, Cone and Semidefinite Programming
Steepest Edge as Applied to the Standard Simplex Method
Gavriel Yarmish, Richard Van Slyke
Applications — Science and Engineering
Stability of Polynomial Differential Equations: Complexity and Converse Lyapunov Questions
Amir Ali Ahmadi, Pablo A. Parrilo
Nonlinear Optimization
On the Incomplete Oblique Projections Method for Solving Box Constrained Least Squares Problems
H Scolnik, N. Echebest, MT Guardarucci
Convex and Nonsmooth Optimization
On the Coupled Continuous Knapsack Problems: Projection Onto the Volume Constrained Gibbs N-Simplex
Rouhollah Tavakoli
Robust Optimization
Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization
Dimitris Bertsimas, Angelos Georghiou
Stochastic Programming
Ancestral Benders' Cuts and Multi-term Disjunctions for Mixed-Integer Recourse Decisions in Stochastic Programming
Yunwei Qi, Suvrajeet Sen
Applications — Science and Engineering
Optimal control of leukemic cell population dynamics
Xavier Dupuis
Applications — OR and Management Sciences
The Vehicle Platooning Problem: Computational Complexity and Heuristics
Erik Larsson, Sennton Gustav, Jeffrey Larson
Convex and Nonsmooth Optimization
Quadratic growth and critical point stability of semi-algebraic functions
Dmitriy Drusvyatskiy, Alexander D. Ioffe
Convex and Nonsmooth Optimization
Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization
Cong D. Dang, Guanghui Lan
Convex and Nonsmooth Optimization
An Inexact Successive Quadratic Approximation Method for Convex L-1 Regularized Optimization
Richard Byrd, Jorge Nocedal, Figen Oztoprak
Robust Optimization
A Convex Optimization Approach for Computing Correlated Choice Probabilities with Many Alternatives
Selin Ahipasaoglu, Xiaobo Li, Karthik Natarajan
Convex and Nonsmooth Optimization
Large-scale optimization with the primal-dual column generation method
Jacek Gondzio, Pablo González-Brevis, Pedro Munari
Linear, Cone and Semidefinite Programming
Forbidden vertices
Gustavo Angulo, Shabbir Ahmed, Santanu S. Dey, Volker Kaibel
Combinatorial Optimization
A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially
Volker Kaibel, Stefan Weltge
Convex and Nonsmooth Optimization
Accelerated Proximal Stochastic Dual Coordinate Ascent for Regularized Loss Minimization
Shai Shalev-Shwartz, Tong Zhang
Stochastic Programming
Ambiguous Probabilistic Programs
Zhaolin Hu, Jeff L Hong, Man-Cho Anthony So
Nonlinear Optimization
On the use of iterative methods in cubic regularization for unconstrained optimization
Tommaso Bianconcini, Giampaolo Liuzzi, Benedetta Morini, Marco Sciandrone
Integer Programming
Forbidden vertices
Gustavo Angulo, Shabbir Ahmed, Santanu S. Dey, Volker Kaibel
Linear, Cone and Semidefinite Programming
Trust-Region Problems with Linear Inequality Constraints: Exact SDP Relaxation, Global Optimality and Robust Optimization
V. Jeyakumar, G. Li
Linear, Cone and Semidefinite Programming
Strengthened Bounds for the Probability of k-Out-Of-n Events
Feng Qiu, Shabbir Ahmed, Santanu S. Dey
Stochastic Programming
Data-Driven Chance Constrained Stochastic Program
Ruiwei Jiang, Yongpei Guan
Applications — OR and Management Sciences
Existence of Competitive Equilibrium in Piecewise Linear and Concave Exchange Economies and the non-symmetric Nash Bargaining Solution
Somdeb Lahiri
Global Optimization
Rounding on the standard simplex: regular grids for global optimization
Immanuel M. Bomze, Stefan Gollowitzer, E. Alper Yildirim
Convex and Nonsmooth Optimization
Primal-dual methods for solving infinite-dimensional games
Pavel Dvurechensky, Yurii Nesterov, Vladimir Spokoiny
Integer Programming
A pseudo-polynomial size formulation for 2-stage two-dimensional knapsack problems
Fabio Furini, Enrico Malaguti
Linear, Cone and Semidefinite Programming
Speeding up Chubanov’s method for solving a homogeneous inequality system
Kees Roos
Nonlinear Optimization
A new and improved quantitative recovery analysis for iterative hard thresholding algorithms in compressed sensing
Coralia Cartis, Andrew Thompson
Applications — OR and Management Sciences
Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing
Dimitri Papageorgiou, Ahmet Keha, George Nemhauser, Joel Sokol
Convex and Nonsmooth Optimization
Smooth minimization of nonsmooth functions with parallel coordinate descent methods
Olivier Fercoq, Peter Richtarik
Nonlinear Optimization
Complementarity Formulations of l0 -norm Optimization Problems
Mingbin Feng, John E Mitchell, Jong-Shi Pang, Xin Shen, Andreas Wächter
Convex and Nonsmooth Optimization
Quantitative Characterizations of Regularity Properties of Collections of Sets
Alexander Y. Kruger, Nguyen H. Thao
Combinatorial Optimization
On Solving a Hard Quadratic 3-Dimensional Assignment Problem
Hans D Mittelmann, Domenico Salvagnin
Combinatorial Optimization
Ray Projection for Optimizing Polytopes with Prohibitively Many Constraints in Set-Covering Column Generation
Daniel Porumbel
Applications — Science and Engineering
Convex Quadratic Relaxations of Power Flows
Hassan Lionel Hijazi, Carleton Coffrin, Pascal Van Hentenryck
Applications — OR and Management Sciences
Optimization Methods for Disease Prevention and Epidemic Control
Yan Deng, Siqian Shen, Yevgeniy Vorobeychik
Convex and Nonsmooth Optimization
The Direct Extension of ADMM for Multi-block Convex Minimization Problems is Not Necessarily Convergent
Caihua Chen, Bingsheng He, Yinyu Ye, Xiaoming Yuan
|