Nonlinear programming: Global use of the Lagrangian

DOI10.1007/BF00927048MaRDI QIDQ2535944zbMATH OpenFDO

Authors Yanyan Li

Publication date 1970

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00927048

zbMATH Keywords

operations research

Cites work

• A nonlinear programming technique for the optimization of continuous processing systems
• DYNAMIC PROGRAMMING AND LAGRANGE MULTIPLIERS
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Geometric programming with signomials
• Global Maximization of a Convex Function with Linear Inequality Constraints
• scientific article; zbMATH DE number 3215121 (Why is no real title available?)
• scientific article; zbMATH DE number 3286662 (Why is no real title available?)
• scientific article; zbMATH DE number 3301979 (Why is no real title available?)
• Sequential Search: A Method for Solving Constrained Optimization Problems
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints

Cited in

(5)

• Discretizing dynamic programs
• The use of pseudo-convexity and quasi-convexity in sufficient conditions for global constrained extrema†
• Least square approach for system reliability optimization†
• A sufficient condition for global constrained extrema†
• Identification of contact pressures between deformable bodies by combining Finite elements and a novel hybrid minimization strategy

This page was built for publication: Nonlinear programming: Global use of the Lagrangian

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