-

 

 

 




Optimization Online





 

All Areas Submissions - November 2010

Applications — OR and Management Sciences
Robust Unit Commitment Problem with Demand Response and Wind Energy
Long Zhao, Bo Zeng

Global Optimization
A modified DIRECT algorithm for a problem in astrophysics
Daniela di Serafino, Giampaolo Liuzzi, Veronica Piccialli, Filippo Riccio, Gerardo Toraldo

Convex and Nonsmooth Optimization
The Inexact Spectral Bundle Method for Convex Quadratic Semidefinite Programming
Lin Huiling

Other Topics
Estimating Derivatives of Noisy Simulations
Jorge Moré, Stefan Wild

Global Optimization
Convex envelopes for quadratic and polynomial functions over polytopes
M Locatelli

Applications — OR and Management Sciences
Radio Planning of Energy-Aware Cellular Networks
Silvia Boiardi, Capone Antonio, Sansò Brunilde

Convex and Nonsmooth Optimization
Convergence analysis of primal-dual algorithms for total variation image restoration
Bingsheng He, Xiaoming Yuan

Convex and Nonsmooth Optimization
Symmetric tensor approximation hierarchies for the completely positive cone
Hongbo Dong

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

Applications — OR and Management Sciences
A heuristic block coordinate descent approach for controlled tabular adjustment
Jose Antonio Gonzalez, Jordi Castro

Nonlinear Optimization
Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint

Convex and Nonsmooth Optimization
Bundle-type methods uniformly optimal for smooth and nonsmooth convex optimization
Guanghui Lan

Integer Programming
Convex Relaxations and Mixed-Integer Quadratic Reformulations for Cardinality Constrained Quadratic Programs
Xiaojin Zheng, Xiaoling Sun, Duan Li

Integer Programming
On the Chvtal-Gomory Closure of a Compact Convex Set
Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma

Linear, Cone and Semidefinite Programming
Grothendieck inequalities for semidefinite programs with rank constraint
Jop Briet, Fernando M. de Oliveira Filho, Frank Vallentin

Convex and Nonsmooth Optimization
On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems
Etienne De Klerk, Monique Laurent

Convex and Nonsmooth Optimization
Finding approximately rank-one submatrices with the nuclear norm and l1 norm
Xuan Vinh Doan, Stephen A Vavasis

Nonlinear Optimization
A Feasible method for Optimization with Orthogonality Constraints
Zaiwen Wen, Wotao Yin

Integer Programming
The Gomory-Chvatal closure of a non-rational polytope is a rational polytope
Dunkel, Schulz

Robust Optimization
Robust Timing of Markdowns
Michael Dziecichowicz, Daniela Caro, Aurelie Thiele

Applications — Science and Engineering
Optimizing the Layout of Proportional Symbol Maps
Guilherme Kunigami, Pedro J. de Rezende, Cid C. de Souza, Tallys H. Yunes

Convex and Nonsmooth Optimization
Efficient Block-coordinate Descent Algorithms for the Group Lasso
Zhiwei (Tony) Qin, Katya Scheinberg, Donald Goldfarb

Combinatorial Optimization
Minimum cost subset selection with two competing agents
Claudia Marini, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy

Integer Programming
Effective Separation of Disjunctive Cuts for Convex Mixed Integer Nonlinear Programs
Mustafa Kılınç, Jeff Linderoth, James Luedtke

Linear, Cone and Semidefinite Programming
Bad semidefinite programs: they all look the same
Gabor Pataki

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

Integer Programming
Separating tight metric inequalities by bilevel progamming
Sara Mattia

Robust Optimization
Costs and benefits of robust optimization
Ralf Werner

Integer Programming
Random half-integral polytopes
Gábor Braun, Sebastian Pokutta

Integer Programming
Taming the set covering problem: the value of dual information
Belma Yelbay, S. Ilker Birbil, Kerem Bulbul

Linear, Cone and Semidefinite Programming
Simultaneous Column-and-Row Generation for Large-Scale Linear Programs with Column-Dependent-Rows
Ibrahim Muter, S. Ilker Birbil, Kerem Bulbul, Guvenc Sahin

Linear, Cone and Semidefinite Programming
A Robust Algorithm for Semidefinite Programming
Xuan Vinh Doan, Serge Kruk, Henry Wolkowicz

Convex and Nonsmooth Optimization
A contraction method with explicit proximal regularization for linearly constrained convex programming
Bingsheng He, Xiaoming Yuan

Linear, Cone and Semidefinite Programming
On Duality Theory for Non-Convex Semidefinite Programming
Wenyu Sun, Chengjin Li, Raimundo Sampaio

Integer Programming
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation
Martin Bergner, Alberto Caprara, Fabio Furini, Marco Lübbecke, Enrico Malaguti, Emiliano Traversi

Complementarity and Variational Inequalities
First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
Chao Ding, Defeng Sun, Jane J. Ye

Combinatorial Optimization
The Maximum k-Colorable Subgraph Problem and Orbitopes
Tim Januschowski, Marc Pfetsch

Linear, Cone and Semidefinite Programming
Infeasible Constraint-Reduced Interior-Point Methods for Linear Optimization
Meiyun Y. He, Andre L. Tits

Integer Programming
DERIVATIVE-FREE METHODS FOR BOUND CONSTRAINED MIXED-INTEGER OPTIMIZATION
Giampaolo Liuzzi, Stefano Lucidi, Francesco Rinaldi

Applications — OR and Management Sciences
Symmetry in Scheduling Problems
James Ostrowski, Miguel Anjos, Anthony Vannelli

Convex and Nonsmooth Optimization
A Parallel Inertial Proximal Optimization Method
Jean-Christophe Pesquet

Integer Programming
The Robust Network Loading Problem with Dynamic Routing
Sara Mattia

Applications — Science and Engineering
A quasi-Newton projection method for nonnegatively constrained image deblurring
elena loli piccolomini, germana landi

Nonlinear Optimization
Reliable solution of convex quadratic programs with parametric active set methods
Andreas Potschka, Christian Kirches, Hans Georg Bock, Johannes P. Schlöder

Stochastic Programming
An Effective Cost Lower Bound for Multistage Stochastic Linear Programming
C. Beltran-Royo, L. F. Escudero, R. E. Rodriguez-Ravines

Nonlinear Optimization
Generalizations of the limited-memory BFGS method based on quasi-product form of update
Jan Vlcek, Ladislav Luksan

Nonlinear Optimization
Recursive formulation of limited memory variable metric methods
Ladislav Luksan, Jan Vlcek

Nonlinear Optimization
Band preconditioners for the matrix-free truncated Newton method
Ladislav Luksan, Ctirad Matonoha, Jan Vlcek

Robust Optimization
A constraint sampling approach for multi-stage robust optimization
Phebe Vayanos, Daniel Kuhn, Berc Rustem

Other Topics
Cost-sharing mechanisms for scheduling under general demand settings
Sindhura Balireddi, Nelson A. Uhan

Convex and Nonsmooth Optimization
A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
Patrick L. Combettes, Luis Briceno-Arias


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