Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata

DOI10.1016/j.cam.2015.03.037zbMath1316.65045OpenAlexW2030355504MaRDI QIDQ2346642

Teng-Teng Yao, Zheng-Jian Bai

Publication date: 2 June 2015

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2015.03.037

zbMATH Keywords

iterative algorithmnumerical experimentinverse eigenvalue problemalternating direction method of multiplierspositive semidefinitenessprescribed entries

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical solutions to inverse eigenvalue problems (65F18)

Related Items (1)

Solution of the symmetric band partial inverse eigenvalue problem for the damped mass spring system

Uses Software

• SDPT3
• MatrixMarket

Cites Work

• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Solving semidefinite-quadratic-linear programs using SDPT3
• Semi-definite programming techniques for structured quadratic inverse eigenvalue problems
• Computing a nearest symmetric positive semidefinite matrix
• 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
• Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
• Finite element model updating in structural dynamics
• On the alternating direction method of multipliers for nonnegative inverse eigenvalue problems with partial eigendata
• A proximal point algorithm revisit on the alternating direction method of multipliers
• Multiplier and gradient methods
• Optimal Parameter Selection for the Alternating Direction Method of Multipliers (ADMM): Quadratic Problems
• Structured inverse eigenvalue problems
• Semidefinite optimization
• A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
• Practical Optimization
• A Dual Optimization Approach to Inverse Quadratic Eigenvalue Problems with Partial Eigenstructure
• On the method of multipliers for convex programming
• Optimization Procedure to Correct Stiffness and Flexibility Matrices Using Vibration Tests
• Modified Lagrangians in convex programming and their generalizations
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• Numerical Optimization
• Inverse Eigenvalue Problems
• Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
• A descent method for structured monotone variational inequalities
• Navigating in a Graph by Aid of Its Spanning Tree Metric
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata