An augmented Lagrangian decomposition method for block diagonal linear programming problems (Q2314414): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ruszczyński, Andrzej / rank
Normal rank
 
Property / author
 
Property / author: Ruszczyński, Andrzej / 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/0167-6377(89)90055-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2142574689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3038523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Large-Scale Mathematical Programming Part I: Concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method for the optimization of a nonlinear function subject to nonlinear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted simplicial decomposition: Computation and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplier and gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm to maximize certain pseudoconcave functions on polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the frank and Wolfe method of feasible directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590418 / 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: Scenarios and Policy Aggregation in Optimization Under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A regularized decomposition method for minimizing a sum of polyhedral functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel decomposition of multistage stochastic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition in large system optimization using the method of multipliers / rank
 
Normal rank

Latest revision as of 23:02, 19 July 2024

scientific article
Language Label Description Also known as
English
An augmented Lagrangian decomposition method for block diagonal linear programming problems
scientific article

    Statements

    An augmented Lagrangian decomposition method for block diagonal linear programming problems (English)
    0 references
    22 July 2019
    0 references
    linear programming
    0 references
    decomposition
    0 references
    augmented Lagrangians
    0 references

    Identifiers