• Home
  • Search
  • Robust least square semidefinite programming with applications
  • Cite Icon12
  • https://doi.org/10.1007/s10589-013-9634-8Copy DOI Icon

Robust least square semidefinite programming with applications

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In this paper, we consider a least square semidefinite programming problem under ellipsoidal data uncertainty. We show that the robustification of this uncertain problem can be reformulated as a semidefinite linear programming problem with an additional second-order cone constraint. We then provide an explicit quantitative sensitivity analysis on how the solution under the robustification depends on the size/shape of the ellipsoidal data uncertainty set. Next, we prove that, under suitable constraint qualifications, the reformulation has zero duality gap with its dual problem, even when the primal problem itself is infeasible. The dual problem is equivalent to minimizing a smooth objective function over the Cartesian product of second-order cones and the Euclidean space, which is easy to project onto. Thus, we propose a simple variant of the spectral projected gradient method (Birgin et al. in SIAM J. Optim. 10:1196---1211, 2000) to solve the dual problem. While it is well-known that any accumulation point of the sequence generated from the algorithm is a dual optimal solution, we show in addition that the dual objective value along the sequence generated converges to a finite value if and only if the primal problem is feasible, again under suitable constraint qualifications. This latter fact leads to a simple certificate for primal infeasibility in situations when the primal feasible set lies in a known compact set. As an application, we consider robust correlation stress testing where data uncertainty arises due to untimely recording of portfolio holdings. In our computational experiments on this particular application, our algorithm performs reasonably well on medium-sized problems for real data when finding the optimal solution (if exists) or identifying primal infeasibility, and usually outperforms the standard interior-point solver SDPT3 in terms of CPU time.

Similar Papers
  • Book Chapter
  • Citations1

Exploiting Structured Sparsity in Large Scale Semidefinite Programming Problems

  • Jan 01, 2010
  • Masakazu Kojima
  • Conference Article
  • Citations10

Analysis and synthesis of nonlinear controllers for input constrained systems using semidefinite programming optimization

  • Jul 01, 2016
  • Dimitrios Pylorof +1
  • Research Article
  • Citations7

Algorithms for sparse and low-rank optimization: convergence, complexity and applications

  • Jan 01, 2011
  • Columbia Academic Commons (Columbia University)
  • Donald Goldfarb +1
  • Research Article

SIGEST

  • Jan 01, 2007
  • SIAM Review
  • The Editors
  • Research Article
  • Citations7

Numerical algebraic geometry and semidefinite programming

  • Jun 28, 2021
  • Results in Applied Mathematics
  • Jonathan D Hauenstein +3
  • Research Article
  • Citations19

Motion Parameter Estimation for Mobile Sources Using Semidefinite Programming

  • Feb 01, 2023
  • IEEE Transactions on Mobile Computing
  • Xiaoping Wu +1
  • Conference Article
  • Citations4

Minimum-error quantum state discrimination based on semidefinite programming

  • Jul 01, 2008
  • Wang Wengang +2
  • Research Article
  • Citations75

Strong duality in Lasserre’s hierarchy for polynomial optimization

  • Feb 28, 2015
  • Optimization Letters
  • Cédric Josz +1
  • Research Article
  • Citations209

Semidefinite programming duality and linear time-invariant systems

  • Jan 01, 2003
  • IEEE Transactions on Automatic Control
  • V Balakrishnan +1
  • Research Article
  • Citations15

Exploiting low-rank structure in semidefinite programming by approximate operator splitting

  • Oct 19, 2020
  • Optimization
  • Mario Souto +2
  • Conference Article
  • Citations16

Solving large margin estimation of HMMS via semidefinite programming

  • Sep 17, 2006
  • Xinwei Li +1
  • Research Article
  • Citations10

Moment-SOS relaxation of the medium term hydrothermal dispatch problem

  • Jul 06, 2018
  • International Journal of Electrical Power & Energy Systems
  • F Cicconet +1
  • Research Article
  • Citations96

Fractional QCQP With Applications in ML Steering Direction Estimation for Radar Detection

  • Jan 01, 2011
  • IEEE Transactions on Signal Processing
  • Antonio De Maio +4
  • Research Article
  • Citations9

A solution method for combined semi-infinite and semi-definite programming

  • Apr 01, 2004
  • The ANZIAM Journal
  • S J Li +3
  • Conference Article
  • Citations3

Multi-task closed-loop inverse kinematics stability through semidefinite programming

  • May 01, 2020
  • Josep Marti-Saumell +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.