A descent method with linear programming subproblems for nondifferentiable convex optimization (Q1924056): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Numerical methods for nondifferentiable convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A descent algorithm for nonsmooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bundle type approach to the unconstrained minimization of convex nonsmooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a generalized subgradient method for nondifferentiable convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable target value subgradient method / 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: Q4182272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method of Solution for Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of unsmooth functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / 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: Q5593890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146571 / rank
 
Normal rank

Revision as of 14:11, 24 May 2024

scientific article
Language Label Description Also known as
English
A descent method with linear programming subproblems for nondifferentiable convex optimization
scientific article

    Statements

    A descent method with linear programming subproblems for nondifferentiable convex optimization (English)
    0 references
    0 references
    0 references
    0 references
    13 October 1996
    0 references
    proximal-type descent methods
    0 references
    direction-finding subproblem
    0 references
    nondifferentiable convex optimization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references