Interior-point Lagrangian decomposition method for separable convex optimization (Q846931): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Ion Necoara / rank
Normal rank
 
Property / author
 
Property / author: Johan A. K. Suykens / rank
Normal rank
 
Property / author
 
Property / author: Ion Necoara / rank
 
Normal rank
Property / author
 
Property / author: Johan A. K. Suykens / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OOPS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053764342 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1302.3136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel interior-point solver for structured linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of a Smoothing Technique to Decomposition in Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating direction splittings for block angular parallel optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal-based deomposition method for compositions method for convex minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some efficient interior point methods for nonlinear convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global linear convergence of a path-following algorithm for some monotone variational inequality problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A path following algorithm for a class of convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel interior point schemes for solving multistage convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the method of multipliers for mathematical programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical View of Interior-Point Methods in Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained model predictive control: Stability and optimality / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 10:53, 2 July 2024

scientific article
Language Label Description Also known as
English
Interior-point Lagrangian decomposition method for separable convex optimization
scientific article

    Statements

    Interior-point Lagrangian decomposition method for separable convex optimization (English)
    0 references
    15 February 2010
    0 references
    self-concordant functions
    0 references
    augmented Lagrangian decomposition
    0 references
    parallel computations
    0 references
    0 references
    0 references

    Identifiers