\(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications
DOI10.1007/s10255-021-1037-5OpenAlexW3205488124MaRDI QIDQ2240656
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
nonsmooth optimizationeigenvalue optimizationsemidefinite programmingsmooth manifoldsecond-order derivative\(\mathcal{U}\)-Lagrangian\(\mathcal{UV}\)-decomposition
Semidefinite programming (90C22) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Convex functions and convex programs in convex geometry (52A41) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The space decomposition theory for a class of eigenvalue optimizations
- A fast space-decomposition scheme for nonconvex eigenvalue optimization
- Uniform LP duality for semidefinite and semi-infinite programming
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Sensitivity analysis of all eigenvalues of a symmetric matrix
- First and second order analysis of nonlinear semidefinite programs
- A semidefinite programming approach to the quadratic knapsack problem
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Self-regular functions and new search directions for linear and semidefinite optimization
- 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
- A \(\mathcal{VU}\)-algorithm for convex minimization
- The bundle scheme for solving arbitrary eigenvalue optimizations
- Exact matrix completion via convex optimization
- On $\mathcalVU$-theory for Functions with Primal-Dual Gradient Structure
- A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations
- Large-Scale Optimization of Eigenvalues
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- Duality for semi-definite and semi-infinite programming
- Partially Augmented Lagrangian Method for Matrix Inequality Constraints
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
- The 𝒰-Lagrangian of a convex function
- The $\U$-Lagrangian of the Maximum Eigenvalue Function
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
- On Eigenvalue Optimization
- Semidefinite Programming
- Sufficiency of Exact Penalty Minimization
- Handbook of semidefinite programming. Theory, algorithms, and applications
- A second-order bundle method to minimize the maximum eigenvalue function.
- Perfect duality in semi-infinite and semidefinite programming
This page was built for publication: \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications
