A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization
From MaRDI portal
Publication:5124006
DOI10.1137/19M1256415zbMath1450.90035arXiv1904.06784OpenAlexW3085859855MaRDI QIDQ5124006
Maher Nouiehed, Meisam Razaviyayn
Publication date: 17 September 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.06784
Related Items (1)
Cites Work
- Unnamed Item
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- Cubic regularization of Newton method and its global performance
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Nonconvex Phase Synchronization
- On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization
- Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
- Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method
- Some NP-complete problems in quadratic and nonlinear programming
- Trust Region Methods
- On Regularization and Active-set Methods with Complexity for Constrained Optimization
- An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
- On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods
This page was built for publication: A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization
