Grid-based methods for linearly equality constrained optimization problems
From MaRDI portal
Publication:874345
DOI10.1007/BF02831974zbMATH Open1111.49024MaRDI QIDQ874345FDOQ874345
Xuesheng Zhang, Liying Liu, Yan Feng
Publication date: 5 April 2007
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10)
Cites Work
- Title not available (Why is that?)
- `` Direct Search Solution of Numerical and Statistical Problems
- On the Convergence of the Multidirectional Search Algorithm
- On the Convergence of Pattern Search Algorithms
- Theory of Positive Linear Dependence
- Positive bases in numerical optimization
- A convergent variant of the Nelder--Mead algorithm
- Frame based methods for unconstrained optimization
- On the convergence of grid-based methods for unconstrained optimization
- Frame-based ray search algorithms in unconstrained optimization
Cited In (3)
Recommendations
- On the convergence of grid-based methods for unconstrained optimization 👍 👎
- A linearly constrained optimization problem for planar grid generation 👍 👎
- Title not available (Why is that?) 👍 👎
- 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 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Conjugate grids for unconstrained optimisation 👍 👎
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)
