A general method for solving constrained optimization problems

DOI10.1016/0377-2217(85)90092-XzbMath0565.90061OpenAlexW2040344251MaRDI QIDQ1058991

Cosimo Resina

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90092-x

zbMATH Keywords

system of ordinary differential equationsconstrained minimizationnumerical analysisasymptotical values of the solutions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

K-K-T multiplier estimates and objective function lower bounds from projective SUMT

Cites Work

• An efficient curvilinear method for the minimization of a nonlinear function subject to linear inequality constraints
• Nonlinear programming codes. Information, tests, performance
• Test example for nonlinear programming codes
• Differential gradient methods
• A Newton-type curvilinear search method for constrained optimization
• A relaxation method for solving problems of non-linear programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item