Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
From MaRDI portal
Publication:5578032
Cited in
(62)- A new method for solving the sum of linear and linear fractional programming problems
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- On Rosen's gradient projection methods
- An alternate implementation of Goldfarb's minimization algorithm
- A projective method for structured nonlinear programs
- A computational study of active set strategies in nonlinear programming with linear constraints
- Decentralized optimization for distributed-lag models of discrete systems
- A new procedure for solving integer linear programming problems
- The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables
- An application of the continuous time replicator dynamic to economics
- Modifications and implementation of the ellipsoid algorithm for linear programming
- An active set limited memory BFGS algorithm for bound constrained optimization
- A generalized gradient projection method for optimization problems with equality and inequality constraints about arbitrary initial point
- Linearly constrained optimization
- An active-set projected trust region algorithm for box constrained optimization problems
- Near real-time atmospheric contamination source identification by an optimization-based inverse method
- A variance algorithm for constrained minimization with linear constraints
- Discussion on the convergence of Rosen's gradient projection method
- Remarks on the convergence of Rosen's gradient projection method
- A convergence theorem of Rosen’s gradient projection method
- Quadratic termination properties of Davidon's new variable metric algorithm
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- A superlinearly convergent method for minimization problems with linear inequality constraints
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- A dual differentiable exact penalty function
- Minimizing a differentiable function over a differential manifold
- Global convergence of Rosen's gradient projection method
- Algoritmo risolutivo per una classe particolare di problemi di minimo vincolato
- An algorithm for linearly constrained nonlinear programming problems
- Solving a special class of multiple objective linear fractional programming problems
- Minimization methods with constraints
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Matrix factorizations in optimization of nonlinear functions subject to linear constraints
- Large-scale linearly constrained optimization
- A hybrid method fur linearly constrained optimisation problems
- An optimization framework of biological dynamical systems
- scientific article; zbMATH DE number 3812856 (Why is no real title available?)
- Efficient iterative solution of constrained finite element analyses
- Evaluating computational efficiency: A stochastic approach
- scientific article; zbMATH DE number 4007605 (Why is no real title available?)
- A feasible descent cone method for linearly constrained minimization problems
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- Algorithmes de programmation convexe par linéarisation en format constant
- A class of quadratically convergent algorithms for constrained function minimization
- scientific article; zbMATH DE number 3880447 (Why is no real title available?)
- An adaptive gradient algorithm for large-scale nonlinear bound constrained optimization
- Replacement strategies with mixed corrective actions at failure
- Competition in a deregulated air transportation market
- A scaled three-term conjugate gradient method for unconstrained optimization
- Rates of convergence of a one-dimensional search based on interpolating polynomials
- A robust superlinearly convergent algorithm for linearly constrained optimization problems under degeneracy
- scientific article; zbMATH DE number 3963115 (Why is no real title available?)
- An efficient algorithm for minimizing barrier and penalty functions
- A least-distance programming procedure for minimization problems under linear constraints
- An algorithm for solving linearly constrained optimization problems
- Decomposition in large system optimization using the method of multipliers
- Constrained optimization along geodesics
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization
- Equivalence of some quadratic programming algorithms
- An algorithm for minimizing a differentiable function subject to box constraints and errors
- A constrained conjugate gradient method and the solution of linear equations
- Chebyshev approximation by H-polynomials: A numerical method
This page was built for publication: Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5578032)
