Nonlinear programming: Global use of the Lagrangian

DOI10.1007/BF00927048zbMath0184.44403MaRDI QIDQ2535944

Yanyan Li

Publication date: 1970

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

zbMATH Keywords

operations research

Related Items

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

Cites Work

• Geometric programming with signomials
• A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
• DYNAMIC PROGRAMMING AND LAGRANGE MULTIPLIERS
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Global Maximization of a Convex Function with Linear Inequality Constraints
• Sequential Search: A Method for Solving Constrained Optimization Problems
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item