Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem

DOI10.1007/s11075-023-01556-3OpenAlexW4382403881MaRDI QIDQ6141535

Sangho Kum, Jin-Hua Wang, Chong Li, Linglingzhi Zhu, Jen-Chih Yao

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 problemweak sharp minimaconvex composite optimizationlinearized 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proximal method for composite minimization
• Gauss-Newton method for convex composite optimizations on Riemannian manifolds
• Strong KKT conditions and weak sharp solutions in convex-composite optimization
• Error bounds in mathematical programming
• A Riemannian inexact Newton-CG method for constructing a nonnegative matrix with prescribed realizable spectrum
• A Gauss-Newton method for convex composite optimization
• A nonsmooth version of Newton's method
• Inexact subgradient methods for quasi-convex optimization problems
• Methods of constructing certain stochastic matrices
• On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications
• The Dual Normal CHIP and Linear Regularity for Infinite Systems of Convex Sets in Banach Spaces
• Weak Sharp Minima in Mathematical Programming
• Structured inverse eigenvalue problems
• Weak Sharp Minima for Semi-infinite Optimization Problems with Applications
• Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
• Local properties of algorithms for minimizing nonsmooth composite functions
• Descent methods for composite nondifferentiable optimization problems
• First- and Second-Order Epi-Differentiability in Nonlinear Programming
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• Inverse Eigenvalue Problems
• Second-order Sufficiency and Quadratic Growth for Nonisolated Minima
• Weak Sharp Minima: Characterizations and Sufficient Conditions
• On convergence of the Gauss-Newton method for convex composite optimization.

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