|
|
Optimization Online Digest — November 2010
Applications — OR and Management Sciences
Radio Planning of Energy-Aware Cellular Networks
Silvia Boiardi, Capone Antonio, Sansň Brunilde
A heuristic block coordinate descent approach for controlled tabular adjustment
Jose Antonio Gonzalez, Jordi Castro
Symmetry in Scheduling Problems
James Ostrowski, Miguel F. Anjos, Anthony Vannelli
Robust management and pricing of LNG contracts with cancellation options
Vincent Guigues, Claudia Sagastizábal
Applications — Science and Engineering
Optimizing the Layout of Proportional Symbol Maps
Guilherme Kunigami, Pedro J. de Rezende, Cid C. de Souza, Tallys H. Yunes
A quasi-Newton projection method for nonnegatively constrained image deblurring
elena loli piccolomini, germana landi
Numerical estimation of the relative entropy of entanglement
Yuriy Zinchenko, Shmuel Friedland, Gilad Gour
Combinatorial Optimization
Minimum cost subset selection with two competing agents
Claudia Marini, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
A biased random-key genetic algorithm for the Steiner triple covering problem
M.G.C. Resende, R.F. Toso, J.F. Gonçalves, R.M.A. Silva
The Maximum k-Colorable Subgraph Problem and Orbitopes
Tim Januschowski, Marc Pfetsch
Complementarity and Variational Inequalities
First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
Chao Ding, Defeng Sun, Jane J. Ye
Convex and Nonsmooth Optimization
The Inexact Spectral Bundle Method for Convex Quadratic Semidefinite Programming
Lin Huiling
Convergence analysis of primal-dual algorithms for total variation image restoration
Bingsheng He, Xiaoming Yuan
Symmetric tensor approximation hierarchies for the completely positive cone
Hongbo Dong
Bundle-type methods uniformly optimal for smooth and nonsmooth convex optimization
Guanghui Lan
On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems
Etienne De Klerk, Monique Laurent
Finding approximately rank-one submatrices with the nuclear norm and l1 norm
Xuan Vinh Doan, Stephen A Vavasis
Efficient Block-coordinate Descent Algorithms for the Group Lasso
Zhiwei (Tony) Qin, Katya Scheinberg, Donald Goldfarb
A contraction method with explicit proximal regularization for linearly constrained convex programming
Bingsheng He, Xiaoming Yuan
A Parallel Inertial Proximal Optimization Method
Jean-Christophe Pesquet
A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
Patrick L. Combettes, Luis Briceno-Arias
Global Optimization
A modified DIRECT algorithm for a problem in astrophysics
Daniela di Serafino, Giampaolo Liuzzi, Veronica Piccialli, Filippo Riccio, Gerardo Toraldo
Convex envelopes for quadratic and polynomial functions over polytopes
M Locatelli
Reduced RLT Representations for Nonconvex Polynomial Programming Problems
Hanif D. Sherali, Evrim Dalkiran, Leo Liberti
Integer Programming
Using the analytic center in the feasibility pump
Daniel Baena, Jordi Castro
Convex Relaxations and Mixed-Integer Quadratic Reformulations for Cardinality Constrained Quadratic Programs
Xiaojin Zheng, Xiaoling Sun, Duan Li
On the Chvtal-Gomory Closure of a Compact Convex Set
Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma
Effective Separation of Disjunctive Cuts for Convex Mixed Integer Nonlinear Programs
Mustafa Kılınç, Jeff Linderoth, James Luedtke
Separating tight metric inequalities by bilevel programming
Sara Mattia
Random half-integral polytopes
Gábor Braun, Sebastian Pokutta
Taming the set covering problem: the value of dual information
Belma Yelbay, S. Ilker Birbil, Kerem Bulbul
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation
Martin Bergner, Alberto Caprara, Fabio Furini, Marco Lübbecke, Enrico Malaguti, Emiliano Traversi
DERIVATIVE-FREE METHODS FOR BOUND CONSTRAINED MIXED-INTEGER OPTIMIZATION
Giampaolo Liuzzi, Stefano Lucidi, Francesco Rinaldi
The Robust Network Loading Problem with Dynamic Routing
Sara Mattia
Linear, Cone and Semidefinite Programming
Grothendieck inequalities for semidefinite programs with rank constraint
Jop Briet, Fernando M. de Oliveira Filho, Frank Vallentin
Bad semidefinite programs: they all look the same
Gabor Pataki
Simultaneous Column-and-Row Generation for Large-Scale Linear Programs with Column-Dependent-Rows
Ibrahim Muter, S. Ilker Birbil, Kerem Bulbul
A Robust Algorithm for Semidefinite Programming
Xuan Vinh Doan, Serge Kruk, Henry Wolkowicz
On Duality Theory for Non-Convex Semidefinite Programming
Wenyu Sun, Chengjin Li, Raimundo Sampaio
Infeasible Constraint-Reduced Interior-Point Methods for Linear Optimization
Meiyun Y. He, Andre L. Tits
A Polynomial Arc-Search Interior-Point Algorithm for Linear Programming
Yaguang Yang
A Polynomial Arc-Search Interior-Point Algorithm for Convex Quadratic Programming
Yaguang Yang
Nonlinear Optimization
Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
A Feasible method for Optimization with Orthogonality Constraints
Zaiwen Wen, Wotao Yin
Reliable solution of convex quadratic programs with parametric active set methods
Andreas Potschka, Christian Kirches, Hans Georg Bock, Johannes P. Schlöder
Generalizations of the limited-memory BFGS method based on quasi-product form of update
Jan Vlcek, Ladislav Luksan
Recursive formulation of limited memory variable metric methods
Ladislav Luksan, Jan Vlcek
Band preconditioners for the matrix-free truncated Newton method
Ladislav Luksan, Ctirad Matonoha, Jan Vlcek
Robust Optimization
Robust Timing of Markdowns
Michael Dziecichowicz, Daniela Caro, Aurelie Thiele
Costs and benefits of robust optimization
Ralf Werner
Stochastic Programming
An Effective Cost Lower Bound for Multistage Stochastic Linear Programming
C. Beltran-Royo, L. F. Escudero, R. E. Rodriguez-Ravines
Other Topics
Estimating Derivatives of Noisy Simulations
Jorge Moré, Stefan Wild
Cost-sharing mechanisms for scheduling under general demand settings
Sindhura Balireddi, Nelson A. Uhan
|