An alternate implementation of Goldfarb's minimization algorithm
From MaRDI portal
Publication:4068458
Cites work
- scientific article; zbMATH DE number 3476911 (Why is no real title available?)
- scientific article; zbMATH DE number 3284927 (Why is no real title available?)
- scientific article; zbMATH DE number 3356498 (Why is no real title available?)
- scientific article; zbMATH DE number 3363343 (Why is no real title available?)
- A Rapidly Convergent Descent Method for Minimization
- A stabilization of the simplex method
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- Quadratic Termination Properties of Minimization Algorithms I. Statement and Discussion of Results
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The Solution of Large Sparse Unsymmetric Systems of Linear Equations
Cited in
(10)- Shape derivative of discretized problems
- Algorithms for nonlinear constraints that use lagrangian functions
- Matrix factorizations in optimization of nonlinear functions subject to linear constraints
- Large-scale linearly constrained optimization
- Procedures for optimization problems with a mixture of bounds and general linear constraints
- Evaluating computational efficiency: A stochastic approach
- A class of differential descent methods for constrained optimization
- A derivative-free affine scaling trust region methods based on probabilistic models with new nonmonotone line search technique for linear inequality constrained minimization without strict complementarity
- Shape optimization for non-smooth geometry in two dimensions
- An algorithm for minimizing a differentiable function subject to box constraints and errors
This page was built for publication: An alternate implementation of Goldfarb's minimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4068458)
