Extension of unconstrained minimization methods to linearly constrained problems

DOI10.1080/02331938408842929MaRDI QIDQ3220108zbMATH OpenOpenAlexFDO

Authors Wolfgang Schneiderheinze

Publication date 1984

Published in Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331938408842929

zbMATH Keywords

algorithmsunconstrained optimizationconvergence theoremslinearly constrained problems

Mathematics Subject Classification ID

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

Recommendations

• An unconstrained optimization technique for large-scale linearly constrained convex minimization problems
• scientific article; zbMATH DE number 3932802
• Unconstrained minimization approaches to nonlinear complementarity problems
• scientific article; zbMATH DE number 3876932
• A method of linearizations for linearly constrained nonconvex nonsmooth minimization
• scientific article; zbMATH DE number 3916028
• A constraint linearization method for nondifferentiable convex minimization
• scientific article; zbMATH DE number 5653878
• Unconstrained convex programming approach to linear programming
• Linearly constrained nonsmooth and nonconvex minimization

Cited in

(1)

• A globally convergent version of a general recursive algorithm for nonlinear programming

This page was built for publication: Extension of unconstrained minimization methods to linearly constrained problems

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