Optimization Online


Linear, Cone and Semidefinite Programming Submissions - 2004

February 2004

An $O(\sqrt{n}\log \frac{(x^0)^Ts^0}{\epsilon})$ iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone linear complementarity problems
Wenbao Ai, Shuzhong Zhang

March 2004

Semi-definite Programming
Preprocessing sparse semidefinite programs via matrix completion
Katsuki Fujisawa, Mituhiro Fukuda, Kazuhide Nakata

Semi-definite Programming
A new notion of weighted centers for semidefinite programming
Chek Beng Chua

Hyperbolic Programs, and Their Derivative Relaxations
James Renegar

April 2004

Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
Bharath Kumar Rangarajan

Linear Programming
On Implementing Self-Regular Proximity Based Feasible IPMs
Xiaohang Zhu, Jiming Peng, Tamás Terlaky, Guoqing Zhang

Semi-definite Programming
An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems over Symmetric Cones
Masakazu Kojima, Masakazu Muramatsu

Solving some special cases of Inexact Linear Programming problems via cutting plane methods.
Walter Gomez, Juan Alfredo Gomez

May 2004

An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex QP
Zhaosong Lu, Renato Monteiro, Jerome O'Neal

Linear Programming
Sensitivity analysis for linear optimization problem with fuzzy data in the objective function
Stephan Dempe, Tatiana Starostina

Linear Programming
Erik Alex Quiroz, Paulo Roberto Oliveira

June 2004

Universal Duality in Conic Convex Optimization
Simon P. Schurr, Andr\'e Tits, Dianne P. O'Leary

Primal-Dual Interior-Point Algorithms for Semidefinite Optimization Based on a Simple Kernel Function
G. Q. Wang, Y. Q. Bai, C. Roos

Invariance and efficiency of convex representations
Chek Beng Chua, Levent Tuncel

July 2004

Semi-definite Programming
A direct formulation for sparse PCA using semidefinite programming
A d'Aspremont, L. El Ghaoui, M. I. Jordan, G. R. G. Lanckriet

Semi-definite Programming
Computational Enhancements in Low-Rank Semidefinite Programming
Samuel Burer, Changhui Choi

On exploiting structure induced when modelling an intersection of cones in conic optimization
Erling D. Andersen

August 2004

Adaptive Large Neighborhood Self-Regular Predictor-Corrector IPMs for LO
Maziar Salahi, Tama's Terlaky

Linear Programming
Sensitivity analysis in linear optimization: Invariant support set intervals
Alireza Ghaffari Hadigheh, Tama's Terlaky

Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
Akiko Yoshise

Linear Programming
Erik Alex Quiroz, Paulo Roberto Oliveira

Linear Programming
Interior point methods for large-scale linear programming
John E. Mitchell, Kris Farwell, Daryn Ramsden

September 2004

Dual versus primal-dual interior-point methods for linear and conic programming
M. J. Todd

Perturbation analysis of second order programming problems
J. Frédéric Bonnans, Hector Ramirez C.

October 2004

Linear Programming
A New Complexity Result on Solving the Markov Decision Problem
Yinyu Ye

Linear Programming
A Stable Iterative Method for Linear Programming
Maria Gonzalez-Lima, Hua Wei, Henry Wolkowicz

On the Behavior of the Homogeneous Self-Dual Model for Conic Convex Optimization
Robert M. Freund

Second-Order Cone Programming
The Q Method for Second-order Cone Programming
Farid Alizadeh, Yu Xia

Second-Order Cone Programming
A Note on 2-dimensional Second-order Cone Programming and Its Simplex Method
Farid Alizadeh, Yu Xia

Second-Order Cone Programming
An Algorithm for Perturbed Second-order Cone Programs
Yu Xia

The Q Method for Symmetric Cone Programming
Farid Alizadeh, Yu Xia

Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity
Hayato Waki, Sunyoung Kim, Masakazu Kojima, Masakazu Muramatsu

November 2004

Semi-definite Programming
Large-Scale Semidefinite Programming via Saddle Point Mirror-Prox Algorithm
Zhaosong Lu, Arkadi Nemirovski, Renato Monteiro

Semi-definite Programming
Convergent relaxations of polynomial matrix inequalities and static output feedback
Didier Henrion, Jean B. Lasserre

Second-Order Cone Programming
A New Primal-Dual Interior-Point Algorithm for Second-Order Cone Optimization
Y.Q. Bai, G.Q. Wang, C. Roos

New variant on the Mizuno-Todd-Ye predictor-corrector algorithm
Tibor Illés, Marianna Nagy

December 2004

Magnetic Resonance Tissue Density Estimation using Optimal SSFP Pulse-Sequence Design
Christopher Anand, Renata Sotirov, Tamas Terlaky, Zhuo Zheng

Second-Order Cone Programming
A Fully Sparse Implementation of a Primal-Dual Interior-Point Potential Reduction Method for Semidefinite Programming
Gun Srijuntongsiri, Stephen Vavasis

Semi-definite Programming
Sums of Random Symmetric Matrices and Applications
Arkadi Nemirovski

Linear Programming
Computational Experience with Rigorous Error Bounds for the Netlib Linear Programming Library
Christian Keil, Christian Jansson

Lowner's Operator and Spectral Functions in Euclidean Jordan Algebras

How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds.
Antoine Deza, Eissa Nematollahi, Tamas Terlaky

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