A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality (Q1257414): 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: Mokhtar S. Bazaraa / rank
Normal rank
 
Property / author
 
Property / author: Jamie J. Goode / rank
Normal rank
 
Property / author
 
Property / author: Mokhtar S. Bazaraa / rank
 
Normal rank
Property / author
 
Property / author: Jamie J. Goode / 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/0377-2217(79)90228-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004001651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infeasibility-Pricing Decomposition Method for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry and resolution of duality gaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem: A duality approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thevenin decomposition and large-scale optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Max-Min, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Decomposition Algorithm for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for some minimax problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange multipliers and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Separable Nonconvex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5821624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the one-machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145425 / 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: Duality in Nonlinear Programming: A Simplified Applications-Oriented Development / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steepest Ascent for Large Scale Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5806966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124607 / 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: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of unsmooth functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence rate of the gradient descent method with dilatation of the space / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Some Special Nondifferentiable Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5610175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Gradient Methods under Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Conditions for Nonlinear Programming Algorithms / rank
 
Normal rank

Latest revision as of 01:11, 13 June 2024

scientific article
Language Label Description Also known as
English
A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
scientific article

    Statements

    A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality (English)
    0 references
    1979
    0 references
    Lagrangian Multipliers
    0 references
    Lagrangian Duality
    0 references
    Subdifferentials
    0 references
    Steepest Ascent Directions
    0 references
    Shortest Subgradients
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers