A parallel algorithm for constrained optimization problems (Q1903662): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Enlarging the region of convergence of Newton's method for constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel quasi-Newton methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4316430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplier and gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent, implementable multiplier method with automatic penalty limitation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equality and inequality constrained optimization algorithms with convergent stepsizes / rank
 
Normal rank

Latest revision as of 07:48, 24 May 2024

scientific article
Language Label Description Also known as
English
A parallel algorithm for constrained optimization problems
scientific article

    Statements

    A parallel algorithm for constrained optimization problems (English)
    0 references
    0 references
    25 March 1997
    0 references
    A simple parallel technique is proposed to aid in the solution of constrained optimization problems. Convergence results are established; a small set of numerical experiments is reported.
    0 references
    parallel algorithm
    0 references
    method of multipliers
    0 references
    numerical examples
    0 references
    convergence
    0 references
    constrained optimization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references