-

 

 

 




Optimization Online





 

Optimization Online Digest — June 2013

Applications — OR and Management Sciences

Optimization Techniques for the Brazilian Natural Gas Network Planning Problem
Leonardo A.M. Moraes, Sergio V.B. Bruno, Welington Oliveira

A Mixed Integer Nonlinear Programming Framework for Fixed Path Coordination of Multiple Underwater Vehicles under Acoustic Communication Constraints
Solmaz Torabi, Shambadeb Basu, Hande Benson, Pramod Abichandani

An MILP approach to Multi-location, Multi-Period Equipment Selection for Surface Mining with Case Studies
C Burt, L Caccetta, L Fouche, P Welgama

Applications — Science and Engineering

Exploring the Modeling Capacity of Two-stage Robust Optimization -- Two Variants of Robust Unit Commitment Model
Yu An, Bo Zeng

Convex and Nonsmooth Optimization

Forward-Backward and Tseng's Type Penalty Schemes for Monotone Inclusion Problems
Radu Ioan Bot, Ernö Robert Csetnek

KKT Reformulation and Necessary Conditions for Optimality in Nonsmooth Bilevel Optimization
Stephan Dempe, Alain B. Zemkoho

One condition for all: solution uniqueness and robustness of l1-synthesis and l1-analysis minimizations
Hui Zhang, Ming Yan, Wotao Yin

Optimal parameter selection for the alternating direction method of multipliers (ADMM): quadratic problems
Euhanna Ghadimi, André Teixeira, Iman Shames, Mikael Johansson

On smoothness properties of optimal value functions at the boundary of their domain under complete convexity
Oliver Stein, Nathan Sudermann-Merx

A Deterministic Rescaled Perceptron Algorithm
Javier Pena, Negar Soheili

A Second-Order Method for Strongly Convex L1-Regularization Problems
Kimon Fountoulakis, Jacek Gondzio

Randomized Block Coordinate Non-Monotone Gradient Method for a Class of Nonlinear Programming
Zhaosong Lu, Lin Xiao

New Analysis and Results for the Conditional Gradient Method
Robert Freund, Paul Grigas

A Parallel Bundle Framework for Asynchronous Subspace Optimisation of Nonsmooth Convex Functions
Frank Fischer, Christoph Helmberg

Global Optimization

Branching and Bounding Improvements for Global Optimization Algorithms with Lipschitz Continuity Properties
Coralia Cartis, Jaroslav M. Fowkes, Nicholas I. M. Gould

Infinite Dimensional Optimization

A branch and bound approach for convex semi-infinite programming
H.A. Le Thi, Mohand Ouanes, A.I.F. Vaz

A cutting surface algorithm for semi-infinite convex programming with an application to moment robust optimization
Sanjay Mehrotra, David Papp

Integer Programming

Closedness of Integer Hulls of Simple Conic Sets
Diego Moran, Santanu S. Dey

A Penalized Quadratic Convex Reformulation Method for Random Quadratic Unconstrained Binary Optimization
Karthik Natarajan, Dongjian Shi, Kim Chuan Toh

Mixed Integer Second-Order Cone Programming Formulations for Variable Selection
Ryuhei Miyashiro, Yuichi Takano

On Minimal Valid Inequalities for Mixed Integer Conic Programs
Fatma Kilinc-Karzan

Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs
Minjiao Zhang, Simge Küçükyavuz

Extended Linear Formulation for Binary Quadratic Problems
Fabio Furini, Emiliano Traversi

Linear, Cone and Semidefinite Programming

Facially exposed cones are not always nice
Vera Roshchina

A new tractable approximation hierarchy for general polynomial optimization problems
Peter J.C. Dickinson, Janez Povh

Some preconditioners for systems of linear inequalities
Javier Pena, Vera Roshchina, Negar Soheili

A non-Iterative Algorithm with Polynomially Many Arithmetic Operations for Linear Programming
Jing-Yuan Wei

Network Optimization

Distributed Optimization With Local Domain: Applications in MPC and Network Flows
João Mota, João Xavier, Pedro Aguiar, Markus Püschel

Nonlinear Optimization

A Riemannian symmetric rank-one trust-region method
Wen Huang, P.-A. Absil, K. A. Gallivan

A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for $\ell_1$-regularized least-squares
Francesco Rinaldi, Margherita Porcelli

Regularizing Bilevel Nonlinear Programs by Lifting
Kathrin Hatz, Sven Leyffer, Johannes P. Schloeder, Hans Georg Bock

Family Constraining of Iterative Algorithms
Yair Censor, Ioana Pantelimon, Constantin Popa

Robust Optimization

A Robust Formulation of the Uncertain Set Covering Problem
Dirk Degel, Pascal Lutter

Robust Optimization of a Class of Bi-Convexe Functions with Application to Inventory Problems
Amir Ardestani-Jaafari, Erick Delage

Stochastic Programming

Monte Carlo Sampling-Based Methods for Stochastic Optimization
Tito Homem-de-Mello, Guzin Bayraksan

Sample Average Approximation Method for Compound Stochastic Optimization Problems
Yuri Ermoliev, Vladimir Norkin

An approximation scheme for a class of risk-averse stochastic equilibrium problems
Juan Pablo Luna, Claudia Sagastizábal, Mikhail Solodov

Other Topics

Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
Nir Halman, Diego Klabjan, Chung-Lun Li, Jim Orlin, David Simchi-Levi


  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 Optimization Society