Finding Second-Order Stationary Points in Constrained Minimization: A Feasible Direction Approach

This paper introduces a method for computing points satisfying the second-order necessary optimality conditions for nonconvex minimization problems subject to a closed and convex constraint set. The method comprises two independent steps corresponding to the first- and second-order conditions. The f...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of optimization theory and applications Ročník 186; číslo 2; s. 480 - 503
Hlavní autoři: Hallak, Nadav, Teboulle, Marc
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.08.2020
Springer Nature B.V
Témata:
Applications of Mathematics
Calculus of Variations and Optimal Control; Optimization
Constraints
Engineering
First order algorithms
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Theory of Computation
90C31
90C30
65K05
90C46
Feasible direction methods
Second-order methods
Second-order necessary optimality conditions
90C26
Constrained optimization
ISSN:0022-3239, 1573-2878
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper introduces a method for computing points satisfying the second-order necessary optimality conditions for nonconvex minimization problems subject to a closed and convex constraint set. The method comprises two independent steps corresponding to the first- and second-order conditions. The first-order step is a generic closed map algorithm, which can be chosen from a variety of first-order algorithms, making it adjustable to the given problem. The second-order step can be viewed as a second-order feasible direction step for nonconvex minimization subject to a convex set. We prove that any limit point of the resulting scheme satisfies the second-order necessary optimality condition, and establish the scheme’s convergence rate and complexity, under standard and mild assumptions. Numerical tests illustrate the proposed scheme.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0022-3239
1573-2878
DOI:10.1007/s10957-020-01713-x