A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: RELAX4 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A penalty linear programming method using reduced-gradient basis-exchange techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the choice of step size in subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplier methods: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3865860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming via a Nondifferentiable Penalty Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Set-Covering Problem: A New Implicit Enumeration Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / 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: Q4739659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simplex SON algorithm for LP/embedded network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling with integer variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Results on the New Techniques for Integer Programming Formulations / 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 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: Q4182270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4117588 / 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: A dual approach to solving nonlinear programming problems by unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiplier method of Hestenes and Powell applied to convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of convergent primal-dual subgradient algorithms for decomposable convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Algorithms for Minimizing a Function of Several Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate gradient methods using quasi-Newton updates with inexact line searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean relaxation heuristic for vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation Methods for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cross decomposition for mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146571 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:23, 20 June 2024

scientific article
Language Label Description Also known as
English
A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
scientific article

    Statements

    A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (English)
    0 references
    0 references
    0 references
    1989
    0 references
    primal-dual conjugate subgradient algorithm
    0 references
    primal penalty function
    0 references
    Lagrangian dual function
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references