Program for stream Continuous optimization (contributed)

MB-15: Interior point methods 1
Stream: Continuous optimization (contributed)
Room: 307A
Chair(s): Aurelio Oliveira

• Further development of column generation with the primal-dual interior point method
  Jacek Gondzio
• An interior algorithm for solving nonlinear second-order cone complementarity problems
  Julio López, Miguel Carrasco, Hector Ramirez
• Optimized choice of parameters in interior-point methods for linear programming
  Aurelio Oliveira, Luiz-Rafael Santos, Fernando Villas-Bôas, Clovis Perin

MD-15: Interior point methods 2
Stream: Continuous optimization (contributed)
Room: 307A
Chair(s): Florian Potra

• A new preconditioner for a second order method for compressed sensing problems
  Paula Kikuchi, Aurelio Oliveira
• Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
  Florian Potra

ME-15: Optimization methods
Stream: Continuous optimization (contributed)
Room: 307A
Chair(s): Jacques Desrosiers

• Non-linear conjugate gradient method for vector optimization
  Luis Roman Lucambio Perez, Leandro Prudente
• Improvements of an updating method of Lagrange multipliers in the procedure of listing FJ points for a reverse convex quadratic programming problem
  Syuuji Yamada
• Optimal switching between cash-flow streams
  Thomas Weber
• The pricing problem in column generation
  Jacques Desrosiers, Jean-Bertrand Gauthier

TA-15: Methods and algorithms in convex optimization 1
Stream: Continuous optimization (contributed)
Room: 307A
Chair(s): Jie Tao

• Strong and stable strong Fenchel-Lagrange duality in evenly convex optimization problems
  Maria Dolores Fajardo, Jose Vidal
• A new data qualification in convex multiobjective semi-infinite programming
  Margarita Rodríguez Álvarez, Miguel Goberna, Virginia N. Vera de Serio
• On a convex resource allocation problem with nested lower and upper constraints
  Thibaut Vidal, Daniel Gribel, Patrick Jaillet
• Global linear convergent algorithm to compute the minimum volume enclosing ellipsoid
  Jie Tao

TB-15: Methods and algorithms in convex optimization 2
Stream: Continuous optimization (contributed)
Room: 307A
Chair(s): Matus Benko

• A linear-time algorithm for computing conjugates of piecewise linear-quadratic functions
  Yves Lucet, Tasnuva Haque
• Fast subgradient method with dynamic smoothness parameter
  Enrico Gorgone, Antonio Frangioni, Bernard Gendron
• Sequential injective algorithm for weakly univalent vector equation and its application to mixed second-order cone complementarity problems
  Shunsuke Hayashi
• New stationarity concepts for mathematical programs with disjunctive constraints
  Matus Benko, Helmut Gfrerer

TD-15: Nonconvex optimization and methods
Stream: Continuous optimization (contributed)
Room: 307A
Chair(s): Yi-Shuai NIU

• Double bundle method for nonsmooth DC optimization
  Kaisa Joki, Adil Bagirov, Napsu Karmitsa, Marko M. Mäkelä, Sona Taheri
• Hyperbolic smoothing method applied to the problem of covering solid bodies with equal spheres
  Helder Venceslau, Daniela Lubke, Vinicius Layter Xavier, Adilson Elias Xavier
• On DC decompositions and DC algorithms for polynomial optimization
  Yi-Shuai NIU
• Acceleration of Uzawa method for quadraic programming in contact mechanics
  Yoshihiro Kanno