Robust least square semidefinite programming with applications
From MaRDI portal
Publication:457207
DOI10.1007/S10589-013-9634-8zbMath1330.90061OpenAlexW1999418275WikidataQ57511197 ScholiaQ57511197MaRDI QIDQ457207
Ting Kei Pong, Alfred Ka Chun Ma, Guoyin Li
Publication date: 26 September 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9634-8
robust optimizationinfeasibilitystrong dualityrobust correlation stress testingspectral gradient projection methoduncertain least square SDP
Related Items (4)
On approximate solutions and saddle point theorems for robust convex optimization ⋮ Matrix completion under interval uncertainty ⋮ Penalty Methods for a Class of Non-Lipschitz Optimization Problems ⋮ Robust saddle-point criteria for multi-dimensional control optimisation problems with data uncertainty
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Smooth minimization of non-smooth functions
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- An augmented Lagrangian approach for sparse principal component analysis
- Geometric condition measures and smoothness condition measures for closed convex sets and linear regularity of infinitely many closed convex sets
- A coordinate gradient descent method for nonsmooth separable minimization
- Selected topics in robust convex optimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Introductory lectures on convex optimization. A basic course.
- Robust solutions of linear programming problems contaminated with uncertain data
- A new inexact alternating directions method for monotone variational inequalities
- Correlation stress testing for value-at-risk: an unconstrained convex optimization approach
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Constructing Uncertainty Sets for Robust Linear Optimization
- Theory and Applications of Robust Optimization
- Two-Metric Projection Methods for Constrained Optimization
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- Lectures on Stochastic Programming
- An Application of Error Bounds for Convex Programming in a Linear Space
- Minimizing and Stationary Sequences of Constrained Optimization Problems
- Introduction to Stochastic Programming
- Robust Solutions to Least-Squares Problems with Uncertain Data
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Excessive Gap Technique in Nonsmooth Convex Minimization
- Convex Analysis
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
This page was built for publication: Robust least square semidefinite programming with applications
