Convergence analysis of a proximal newton method<sup>1</sup> (Q4714551): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Zeng-xin Wei / rank
Normal rank
 
Property / author
 
Property / author: Zeng-xin Wei / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/01630569608816705 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2132068809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions for a penalty method to be exact / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Proximal Minimization Algorithms for Convex Pprogramming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal-based deomposition method for compositions method for convex minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of some algorithms for convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of the Proximal Point Algorithm for Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Proximal Point Algorithms for Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of the Proximal Point Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An aggregate subgradient method for nonsmooth convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity control in bundle methods for convex nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined Primal–Dual and Penalty Methods for Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4026938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth Equations: Motivation and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Operators and the Proximal Point Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence properties of descent methods for unconstrained minization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:35, 24 May 2024

scientific article; zbMATH DE number 942643
Language Label Description Also known as
English
Convergence analysis of a proximal newton method<sup>1</sup>
scientific article; zbMATH DE number 942643

    Statements

    Convergence analysis of a proximal newton method<sup>1</sup> (English)
    0 references
    0 references
    0 references
    7 November 1996
    0 references
    proximal Newton method
    0 references
    nonsmooth convex function
    0 references
    global convergence
    0 references
    Moreau-Yosida regularization
    0 references

    Identifiers