Optimization Online


Optimization Online Digest — April 2011

Applications — OR and Management Sciences

Concepts and Applications of Stochastically Weighted Stochastic Dominance
Jian Hu, Tito Homem-de-Mello, Sanjay Mehrotra

A Multi-Product Risk-Averse Newsvendor with Exponential Utility Function
Sungyong Choi, Andrzej Ruszczynski

A biased random-key genetic algorithm for job-shop scheduling
José F. Gonçalves, Mauricio G.C. Resende

Applications — Science and Engineering

On Minimizing the Energy Consumption of an Electrical Vehicle
Abdelkader Merakeb, Frederic Messine, Mohamed Aidene

Combinatorial Optimization

Efficient Solutions for the Far From Most String Problem
Paola Festa, Panos M. Pardalos

On implementation of local search and genetic algorithm techniques for some combinatorial optimization problems
Anton Bondarenko

The Symmetric Quadratic Traveling Salesman Problem
Anja Fischer, Christoph Helmberg

Convex and Nonsmooth Optimization

Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems
Renato DC Monteiro, Benar F Svaiter

Monotonicity recovering and accuracy preserving optimization methods for postprocessing finite element solutions
Oleg Burdakov, Ivan Kapyrin, Yuri Vassilevski

On partially sparse recovery
A. S. Bandeira, K. Scheinberg, L. N. Vicente

Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
A. S. Bandeira, K. Scheinberg, L. N. Vicente

Level methods uniformly optimal for composite and structured nonsmooth convex optimization
Guanghui Lan

Donald Goldfarb , Katya Scheinberg

Group Sparse Optimization by Alternating Direction Method
Wei Deng, Wotao Yin, Yin Zhang

Explicit Solutions for Root Optimization of a Polynomial Family with One Affine Constraint
Vincent D. Blondel, Mert Gurbuzbalaban, Alexander Megretski, Michael L. Overton

A Sparsity Preserving Stochastic Gradient Method for Composite Optimization
Qihang Lin, Xi Chen, Javier Pena

An Infeasible-Point Subgradient Method Using Approximate Projections
Dirk A. Lorenz, Marc E. Pfetsch, Andreas M. Tillmann

Global Optimization

On global optimizations of the rank and inertia of the matrix function $A_1- B_1XB^*_1$ subject to a pair of matrix equations $[\,B_2XB^*_2, \, B_3XB^*_3 \,] = [\,A_2, \, A_3\,]$
Yongge Tian

On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square
Alberto Costa, Pierre Hansen, Leo Liberti

A new look at nonnegativity on closed sets and polynomial optimization
Jean Bernard Lasserre

Integer Programming

Inexact solution of NLP subproblems in MINLP
L. Min, L. N. Vicente

Design and Verify: A New Scheme for Generating Cutting-Planes
Santanu S. Dey, Sebastian Pokutta

Linear, Cone and Semidefinite Programming

Approximation algorithms for trilinear optimization with nonconvex constraints and its extensions
Yuning Yang, Qingzhi Yang

High accuracy solution of large scale semidefinite programs
Thomas Davi, Florian Jarre

Solving large scale problems over the doubly nonnegative cone
Thomas Davi, Florian Jarre

How bad is a gradient algorithm for linear programming?
Peter A. Bruijs

The Second Order Directional Derivative of Symmetric Matrix-valued Functions
Liwei Zhang, Ning Zhang , Xiantao Xiao

Inner approximations for polynomial matrix inequalities and robust stability regions
Didier Henrion, Jean-Bernard Lasserre

A Simple Variant of the Mizuno-Todd-Ye Predictor-Corrector Algorithm and its Objective-Function-Free Complexity
Tomonari Kitahara, Takashi Tsuchiya

Nonlinear Optimization

On the complexity of finding first-order critical points in constrained nonlinear optimization
Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint

A surrogate management framework using rigorous trust-regions steps
S. Gratton, L. N. Vicente

On the Implementation of an Interior-Point Algorithm for Nonlinear Optimization with Inexact Step Computations
Frank Curtis, Johannes Huber, Olaf Schenk, Andreas Waechter

An Implementation of an Algorithm for Nonlinear Programming Based on Piecewise Linear Models
Richard Byrd, Jorge Nocedal, Richard Waltz, Yuchen Wu

Exact Low-rank Matrix Recovery via Nonconvex Mp-Minimization
Lingchen Kong, Naihua Xiu

Optimal Sensitivity Based on IPOPT
Hans Pirnay, Rodrigo Lopez Negrete, Lorenz Biegler

Parallel Stochastic Gradient Algorithms for Large-Scale Matrix Completion
Benjamin Recht, Christopher Re

Global Convergence of Radial Basis Function Trust Region Derivative-Free Algorithms
Stefan Wild, Christine Shoemaker

Robust Optimization

On the Robust Knapsack Problem
Michele Monaci, Ulrich Pferschy

A Robust Robust Optimization Result
Martina Gancarova, Michael Todd

Stochastic Programming

A Matrix-Free Approach For Solving The Gaussian Process Maximum Likelihood Problem
Mihai Anitescu, Jie Chen, Lei Wang

Scalable Stochastic Optimization of Complex Energy Systems
Miles Lubin, Cosmin Petra, Mihai Anitescu, Victor Zavala

Other Topics

Food Regulated Pareto Multi-Species: a new ACO Approach for the Multi-objective Shortest Path Problem
L. C. T. Bezerra, E. F. G. Goldbarg, L. S. Buriol, M. C. Goldbarg

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society