A variable metric method for nonsmooth convex constrained optimization (Q865537): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q984339
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Zhen-Hai Liu / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ACCPM / 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.1016/j.amc.2006.05.132 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067375490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for convex programming that uses analytic centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear programming without a penalty function. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constraint linearization method for nondifferentiable convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ellipsoid Trust Region Bundle 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: Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent variable metric method for convex nonsmooth unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Constrained Optimization with Semismooth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization / rank
 
Normal rank

Latest revision as of 15:02, 25 June 2024

scientific article
Language Label Description Also known as
English
A variable metric method for nonsmooth convex constrained optimization
scientific article

    Statements

    A variable metric method for nonsmooth convex constrained optimization (English)
    0 references
    0 references
    0 references
    19 February 2007
    0 references
    0 references
    constrained optimization
    0 references
    nonsmooth convex optimization
    0 references
    global convergence
    0 references
    mathematical programming
    0 references
    methods of successive quadratic programming
    0 references
    0 references