A Sequential Convex Program Approach to an Inverse Linear Semidefinite Programming Problem

DOI10.1142/S0217595916500251zbMath1346.90660OpenAlexW2482087498MaRDI QIDQ2821091

Yue Lu, Yi Zhang, Jia Wu, Li-wei Zhang

Publication date: 16 September 2016

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595916500251

zbMATH Keywords

penalty methodsmathematical program with semidefinite cone complementarity constraintsinverse linear semidefinite programming problemssequential convex program

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25)

Related Items (3)

Unnamed Item ⋮ A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems ⋮ Inverse semidefinite quadratic programming problem with \(l_1\) norm measure

Cites Work

• Unnamed Item
• Unnamed Item
• Inverse conic programming with applications
• A majorized penalty approach to inverse linear second order cone programming problems
• A sequential convex program method to DC program with joint chance constraints
• A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem
• Inverse Optimization
• Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems

This page was built for publication: A Sequential Convex Program Approach to an Inverse Linear Semidefinite Programming Problem