A relaxation method for solving problems of non-linear programming

DOI10.1016/0041-5553(77)90105-7MaRDI QIDQ4181626zbMATH OpenOpenAlexFDO

Authors

Publication date 1977

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(77)90105-7

zbMATH Keywords

ConvergenceNonlinear ProgrammingNumerical ComputationsRelaxation MethodSaddle-Points

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cited in

(5)

• A general method for solving constrained optimization problems
• ODE versus SQP methods for constrained optimization
• Stable barrier-projection and barrier-Newton methods in linear programming
• Interior point method: history and prospects
• Interior point algorithms in linear optimization

This page was built for publication: A relaxation method for solving problems of non-linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4181626)