Grid-based methods for linearly equality constrained optimization problems
From MaRDI portal
(Redirected from Publication:874345)
Recommendations
- On the convergence of grid-based methods for unconstrained optimization
- A linearly constrained optimization problem for planar grid generation
- scientific article; zbMATH DE number 3954181
- A multigrid approach to discretized optimization problems
- Methods for finding global optimal solutions to linear programs with equilibrium constraints
- Grid-enabled optimization with GAMS
- An efficient algebraic multigrid method for solving optimality systems
- scientific article; zbMATH DE number 6310859
- scientific article; zbMATH DE number 3873096
- Conjugate grids for unconstrained optimisation
Cites work
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- A convergent variant of the Nelder--Mead algorithm
- Frame based methods for unconstrained optimization
- Frame-based ray search algorithms in unconstrained optimization
- On the Convergence of Pattern Search Algorithms
- On the Convergence of the Multidirectional Search Algorithm
- On the convergence of grid-based methods for unconstrained optimization
- Positive bases in numerical optimization
- Theory of Positive Linear Dependence
- `` Direct Search Solution of Numerical and Statistical Problems
Cited in
(4)
This page was built for publication: Grid-based methods for linearly equality constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q874345)
