A parallel algorithm for constrained optimization problems

DOI10.1016/0377-0427(94)00064-8zbMath0859.65061OpenAlexW2032421951MaRDI QIDQ1903662

Yanyan Li

Publication date: 25 March 1997

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(94)00064-8

zbMATH Keywords

convergenceconstrained optimizationnumerical examplesparallel algorithmmethod of multipliers

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Parallel numerical computation (65Y05)

Related Items

A parallel quasi-Newton algorithm for unconstrained optimization

Cites Work

• Parallel algorithms for nonlinear programming problems
• Parallel quasi-Newton methods for unconstrained optimization
• A globally convergent, implementable multiplier method with automatic penalty limitation
• Enlarging the region of convergence of Newton's method for constrained optimization
• Equality and inequality constrained optimization algorithms with convergent stepsizes
• Multiplier and gradient methods
• Unnamed Item
• Unnamed Item
• Unnamed Item