An algorithm for linearly constrained nonlinear programming problems
From MaRDI portal
(Redirected from Publication:1151830)
Cites work
- A scheme for determining stepsizes for unconstrained optimization methods
- An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
- Exact penalty functions in nonlinear programming
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3561096 (Why is no real title available?)
- scientific article; zbMATH DE number 3284927 (Why is no real title available?)
- Large-scale linearly constrained optimization
- Minimization of functions having Lipschitz continuous first partial derivatives
- Newton-type methods for unconstrained and linearly constrained optimization
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- Readily implementable conjugate gradient methods
- Second Order Conditions for Constrained Minima
- Stability of the solution of definite quadratic programs
- The Convex Simplex Method
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- The Variable Reduction Method for Nonlinear Programming
Cited in
(1)
This page was built for publication: An algorithm for linearly constrained nonlinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1151830)