UV-theory of a class of semidefinite programming and its applications

DOI10.1007/S10255-021-1037-5OpenAlexW3205488124MaRDI QIDQ2240656FDOQ2240656

Li-Ping Pang, Zun-Quan Xia, Ming Huang, Jinlong Yuan

Publication date: 4 November 2021

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-021-1037-5

Recommendations

• \(UV\)-decomposition theory for a class of \(D.C.\) constrained optimization problem
• scientific article; zbMATH DE number 1489798
• An exact duality theory for semidefinite programming and its complexity implications
• A unified class of directly solvable semidefinite programming problems
• Semidefinite programming and its applications to NP problems
• Semidefinite programming
• scientific article; zbMATH DE number 1047682
• Semidefinite programming
• Semidefinite Programming

zbMATH Keywords

semidefinite programmingeigenvalue optimizationnonsmooth optimizationsmooth manifoldsecond-order derivative\(\mathcal{U}\)-Lagrangian\(\mathcal{UV}\)-decomposition

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Nonlinear programming (90C30) Semidefinite programming (90C22) Nonsmooth analysis (49J52) Convex functions and convex programs in convex geometry (52A41)

Cites Work

• Exact matrix completion via convex optimization
• Semidefinite Programming
• Self-regular functions and new search directions for linear and semidefinite optimization
• Title not available (Why is that?)
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sensitivity analysis of all eigenvalues of a symmetric matrix
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• First and second order analysis of nonlinear semidefinite programs
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• A \(\mathcal{VU}\)-algorithm for convex minimization
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• The 𝒰-Lagrangian of a convex function
• Uniform LP duality for semidefinite and semi-infinite programming
• Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
• A semidefinite programming approach to the quadratic knapsack problem
• Sufficiency of Exact Penalty Minimization
• Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
• On \(\mathcal{VU}\)-theory for functions with primal-dual gradient structure
• 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
• A second-order bundle method to minimize the maximum eigenvalue function.
• Title not available (Why is that?)
• Partially Augmented Lagrangian Method for Matrix Inequality Constraints
• On Eigenvalue Optimization
• Large-Scale Optimization of Eigenvalues
• The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications
• A space decomposition scheme for maximum eigenvalue functions and its applications
• A spectral quadratic-SDP method with applications to fixed-order \(H_2\) and \(H_\infty\) synthesis
• The space decomposition theory for a class of eigenvalue optimizations
• The $\U$-Lagrangian of the Maximum Eigenvalue Function
• Title not available (Why is that?)
• A fast space-decomposition scheme for nonconvex eigenvalue optimization
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• Duality for semi-definite and semi-infinite programming
• Perfect duality in semi-infinite and semidefinite programming
• The bundle scheme for solving arbitrary eigenvalue optimizations
• A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations

Cited In (3)

• Proximal decomposition of convex optimization via an alternating linearization algorithm with inexact oracles
• Title not available (Why is that?)
• The \(\mathcal{UV}\)-decomposition on a class of d.c. functions and optimality conditions

This page was built for publication: \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2240656)