All Areas Submissions - October 2016
Nonlinear Optimization
Block BFGS Methods
Wenbo Gao, Donald Goldfarb
Applications — Science and Engineering
An Augmented Lagrangian Filter Method for Real-Time Embedded Optimization
Nai-Yuan Chiang, Rui Huang, Victor M. Zavala
Linear, Cone and Semidefinite Programming
Can linear superiorization be useful for linear optimization problems?
Yair Censor
Linear, Cone and Semidefinite Programming
Linear superiorization for infeasible linear programming
Yair Censor, Yehuda Zur
Applications — OR and Management Sciences
The Dynamic Dispatch Waves Problem for Same-Day Delivery
Mathias Klapp, Alan Erera, Alejandro Toriello
Linear, Cone and Semidefinite Programming
Optimized choice of parameters in interior-point methods for linear programming
Luiz Rafael Santos, Fernando Villas-Bôas, Aurelio Ribeiro Leite Oliveira, Clovis Perin
Nonlinear Optimization
R-Linear Convergence of Limited Memory Steepest Descent
Frank E. Curtis, Wei Guo
Applications — OR and Management Sciences
A parametric programming approach to redefine the global configuration of resource constraints of 0-1-Integer Linear Programming problems.
Alejandro Crema
Applications — Science and Engineering
Modulation Design for MIMO-CoMP HARQ
Wenhao Wu, Hans Mittelmann, Zhi Ding
Convex and Nonsmooth Optimization
Variational Geometric Approach to Generalized Differential and Fenchel Conjugate Calculi in Convex Analysis
B.S. Mordukhovich, N. M. Nam, R. B. Rector, T. Tran
Convex and Nonsmooth Optimization
Analysis and Implementation of an Asynchronous Optimization Algorithm for the Parameter Server
Arda Aytekin, Hamid Reza Feyzmahdavian, Mikael Johansson
Convex and Nonsmooth Optimization
Relatively-Smooth Convex Optimization by First-Order Methods, and Applications
Haihao Lu, Robert Freund, Yurii Nesterov
Complementarity and Variational Inequalities
Solvability of linear complementarity problems by using isotone projection cones
A. B. Németh, S. Z. Németh
Integer Programming
Branch-and-bound for biobjective mixed-integer programming
Nathan Adelgren, Akshay Gupte
Integer Programming
Lexicographically optimal integer points: structural properties and complexity
Michael Eldredge, Akshay Gupte
Stochastic Programming
Decision Rule Bounds for Stochastic Bilevel Programs
İhsan Yanıkoğlu, Daniel Kuhn
Linear, Cone and Semidefinite Programming
Moment methods in energy minimization: New bounds for Riesz minimal energy problems
David de Laat
Network Optimization
Complete mixed integer linear programming formulations for modularity density based clustering
Alberto Costa, Tsan Sheng Ng, Lin Xuan Foo
Convex and Nonsmooth Optimization
A general double-proximal gradient algorithm for d.c. programming
Sebastian Banert, Radu Ioan Bot
Nonlinear Optimization
Error bounds for nonlinear semidefinite optimization
Hiroshi Yamashita
Nonlinear Optimization
On the local convergence analysis of the Gradient Sampling method
Elias Salomăo Helou, Sandra A. Santos, Lucas E. A. Simőes
Integer Programming
A Spatial Branch-and-Cut Method for Nonconvex QCQP with Bounded Complex Variables
Chen Chen, Alper Atamturk, Shmuel Oren
Combinatorial Optimization
Novel formulations for general and security Stackelberg games
Carlos Casorrán, Bernard Fortz, Martine Labbé, Fernando Ordóńez
Applications — OR and Management Sciences
New MIP Models for Liner Shipping Route Design with Empty Container Repositioning
Laurent Alfandari, Tatjana Davidovic, Fabio Furini, Ivana Ljubic, Vladislav Maras, Sebastien Martin
Stochastic Programming
Combining Penalty-based and Gauss-Seidel Methods for solving Stochastic Mixed-Integer Problems
Fabricio Oliveira, Christiansen Jeffrey, Dandurand Brian, Eberhard Andrew
Nonlinear Optimization
Quadratic regularization with cubic descent for unconstrained optimization
Ernesto G. Birgin, J. M. Martínez
Complementarity and Variational Inequalities
Solving Linear Programs with Complementarity Constraints using Branch-and-Cut
Bin Yu, John E. Mitchell, Jong-Shi Pang
Nonlinear Optimization
A second-order optimality condition with first and second-order complementarity associated to global convergence of algorithms
Gabriel Haeser
Other Topics
Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes
Daniel Blado, Alejandro Toriello
Global Optimization
Dynamic Spectrum Management: A Complete Complexity Characterization
Ya-Feng Liu
Convex and Nonsmooth Optimization
An Inexact Spingarn's Partial Inverse Method with Applications to Operator Splitting and Composite Optimization
Samara Costa Lima, Maicon Marques Alves
Convex and Nonsmooth Optimization
A proximal-Newton method for unconstrained convex optimization in Hilbert spaces
Maicon Marques Alves, Benar Fux Svaiter
Combinatorial Optimization
An exact approach for the 0–1 Knapsack Problem with Setups
Federico Della Croce, Fabio Salassa, Rosario Scatamacchia
Stochastic Programming
Joint rectangular geometric chance constrained programs
Jia Liu , Chuan Xu , Abdel Lisser, Zhiping Chen
Linear, Cone and Semidefinite Programming
A Complete Characterization of Disjunctive Conic Cuts for Mixed Integer Second Order Cone Optimization
Pietro Belotti, Julio Goez, Imre Polik, Ted Ralphs, Terlaky Tamas
Integer Programming
Lattice closures of polyhedra
Sanjeeb Dash, Oktay Gunluk, Diego Moran
Convex and Nonsmooth Optimization
An Extended Alternating Direction Method for Three-Block Separable Convex Programming
Jianchao Bai, Jicheng Li
Convex and Nonsmooth Optimization
A Primal-Dual Homotopy Algorithm for $\ell_{1}$-Minimization with $\ell_{\infty}$-Constraints
Christoph Brauer, Dirk A. Lorenz, Andreas M. Tillmann
|