An efficient algorithm for minimizing barrier and penalty functions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3310599 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- A New Method for Constrained Optimization Problems
- A duality theorem for non-linear programming
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- An algorithm for solving nonlinear programming problems subject to nonlinear inequality constraints
- Comparison of Gradient Methods for the Solution of Nonlinear Parameter Estimation Problems
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- Nonlinear Programming: A Numerical Survey
- On Non‐Linear Ordinary Differential Equations of Boundary Layer Type
- The Variable Reduction Method for Nonlinear Programming
- Variable metric methods of minimisation
Cited in
(6)- An efficient cyclic coordinate method for optimizing penalty functions
- An efficient one—dimensional search procedure for barrier functions
- On “an efficient algorithm for minimizing barrier and penalty functions”
- Minimization methods with constraints
- A hadamard-stable extension of courant's sequential method for convex extremal problems
- A stable interior penalty method for convex extremal problems
This page was built for publication: An efficient algorithm for minimizing barrier and penalty functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5661720)
