Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization - MaRDI portal

A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization (Q5124006)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7248648

Language	Label	Description	Also known as
English	A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization	scientific article; zbMATH DE number 7248648

Statements

scholarly article

0 references

A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization (English)

0 references

0 references

Meisam Razaviyayn

0 references

SIAM Journal on Optimization

0 references

publication date

17 September 2020

0 references

full work available at URL

https://arxiv.org/abs/1904.06784

0 references

zbMATH Keywords

trust region

0 references

nonconvex optimization

0 references

linear constraints

0 references

second-order stationarity

0 references

MaRDI profile type

MaRDI publication profile

0 references

A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints

0 references

0 references

Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization

0 references

On Regularization and Active-set Methods with Complexity for Constrained Optimization

0 references

Nonconvex Phase Synchronization

0 references

An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity

0 references

Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results

0 references

Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity

0 references

On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization

0 references

On the complexity of finding first-order critical points in constrained nonlinear optimization

0 references

On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods

0 references

Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization

0 references

Trust Region Methods

0 references

A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization

0 references

Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization

0 references

A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization

0 references

Some NP-complete problems in quadratic and nonlinear programming

0 references

Cubic regularization of Newton method and its global performance

0 references

Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture

0 references

Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method

0 references

Identifiers

zbMATH Open document ID

0 references

10.1137/19M1256415

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5124006

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5124006&oldid=37126957"