A regularized decomposition method for minimizing a sum of polyhedral functions (Q3735489): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of some quadratic programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix augmentation and partitioning in the updating of the basis inverse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3288565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized upper bounding techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weighted gram-schmidt method for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerically stable methods for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving stochastic programming problems with recourse including error bounds / 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: Q5630824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The B<scp>oxstep</scp> Method for Large-Scale Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stable method for solving certain constrained least squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale linearly constrained optimization / 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: Primal partition programming for block diagonal matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>L</i>-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3343779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the nearest point in A polytope / rank
 
Normal rank

Latest revision as of 16:02, 17 June 2024

scientific article
Language Label Description Also known as
English
A regularized decomposition method for minimizing a sum of polyhedral functions
scientific article

    Statements

    A regularized decomposition method for minimizing a sum of polyhedral functions (English)
    0 references
    0 references
    1986
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    regularized decomposition method
    0 references
    sum of polyhedral functions
    0 references
    convex piecewise-linear functions
    0 references
    semidefinite quadratic programming
    0 references
    subgradient methods
    0 references
    sum of many convex piecewise-linear functions
    0 references
    main iterates
    0 references
    trial points
    0 references
    approximate problem
    0 references
    active set strategy
    0 references
    Convergence analysis
    0 references
    computational experiences
    0 references