Applications of the method of partial inverses to convex programming: Decomposition (Q3680618): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexification procedures and decomposition methods for nonconvex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by decomposition and coordination: A unified approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Auxiliary problem principle and decomposition of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085497 / 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: Sensitivity analysis for nonlinear programming using penalty methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3318601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3038523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems / 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: Multiplier and gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Convergence Analysis of the Proximal Point Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5633161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone (nonlinear) operators in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal monotonicity of subdifferential mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / 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: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming / 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: Q3908772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4177339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed and Variable Constraints in Sensitivity Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial inverse of a monotone operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual projection method for solving systems of linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projection method for least-squares solutions to overdetermined systems of linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266142 / 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 17:52, 14 June 2024

scientific article
Language Label Description Also known as
English
Applications of the method of partial inverses to convex programming: Decomposition
scientific article

    Statements

    Applications of the method of partial inverses to convex programming: Decomposition (English)
    0 references
    1985
    0 references
    primal-dual decomposition method
    0 references
    separable convex programming
    0 references
    proximal point algorithm
    0 references
    monotone multifunction
    0 references
    linear convergence
    0 references
    0 references
    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
    0 references