Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem

DOI10.1007/S11075-023-01556-3MaRDI QIDQ6141535zbMATH OpenOpenAlexFDO

Authors Sangho Kum, C. Li, J. H. Wang, Jen-Chih Yao, Linglingzhi Zhu

Publication date 19 December 2023

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11075-023-01556-3

zbMATH Keywords

Riemannian manifoldinverse eigenvalue problemconvex composite optimizationweak sharp minimalinearized proximal algorithmquasi-regularity condition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37)

Recommendations

• A Riemannian inexact Newton-CG method for constructing a nonnegative matrix with prescribed realizable spectrum
• Numerical Methods for Solving Inverse Eigenvalue Problems for Nonnegative Matrices
• Nonnegative inverse eigenvalue problems with partial eigendata
• A Riemannian Newton algorithm for nonlinear eigenvalue problems
• A Riemannian optimization approach for solving the generalized eigenvalue problem for nonsquare matrix pencils

Cites work

• scientific article; zbMATH DE number 3705455 (Why is no real title available?)
• scientific article; zbMATH DE number 52737 (Why is no real title available?)
• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• scientific article; zbMATH DE number 1033392 (Why is no real title available?)
• scientific article; zbMATH DE number 5223994 (Why is no real title available?)
• A Gauss-Newton method for convex composite optimization
• A Riemannian inexact Newton-CG method for constructing a nonnegative matrix with prescribed realizable spectrum
• A nonsmooth version of Newton's method
• A proximal method for composite minimization
• Descent methods for composite nondifferentiable optimization problems
• Error bounds in mathematical programming
• First- and Second-Order Epi-Differentiability in Nonlinear Programming
• Gauss-Newton method for convex composite optimizations on Riemannian manifolds
• Inexact subgradient methods for quasi-convex optimization problems
• Inverse Eigenvalue Problems
• Local properties of algorithms for minimizing nonsmooth composite functions
• Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
• Methods of constructing certain stochastic matrices
• On convergence of the Gauss-Newton method for convex composite optimization.
• On convergence rates of linearized proximal algorithms for convex composite optimization with applications
• Second-order Sufficiency and Quadratic Growth for Nonisolated Minima
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• Strong KKT conditions and weak sharp solutions in convex-composite optimization
• Structured inverse eigenvalue problems
• The dual normal CHIP and linear regularity for infinite systems of convex sets in Banach spaces
• Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
• Weak Sharp Minima in Mathematical Programming
• Weak Sharp Minima: Characterizations and Sufficient Conditions

Cited in

(1)

• A Riemannian under-determined BFGS method for least squares inverse eigenvalue problems

This page was built for publication: Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem

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