Corpus ID: 59919672

An interactive approach for solving multi-objective optimization problems (interactive computer, nelder-mead simplex algorithm, graphics)

@inproceedings{Woods1985AnIA,
  title={An interactive approach for solving multi-objective optimization problems (interactive computer, nelder-mead simplex algorithm, graphics)},
  author={D. Woods},
  year={1985}
}
Multi-objective optimization problems are characterized by the need to consider multiple, and possibly conflicting, objectives in the solution process. We present an approach based on the use of interactive computer graphics to obtain qualitative information from a user about approximate solutions. We then use this qualitative information to transform the multi-objective optimization problem into a single-objective optimization problem that we may solve using standard techniques. Preliminary… Expand
53 Citations
Parallel Implementations Of The Nelder-Mead Simplex Algorithm For Unconstrained Optimization
  • J. Dennis, V. Torczon
  • Computer Science, Engineering
  • Photonics West - Lasers and Applications in Science and Engineering
  • 1988
  • 10
Convergence of the Restricted Nelder-Mead Algorithm in Two Dimensions
  • 25
  • PDF
ALGORITHMS FOR BILEVEL OPTIMIZATION
  • 17
  • PDF
Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions
  • 6,039
  • Highly Influenced
  • PDF
A restarted and modified simplex search for unconstrained optimization
  • 33
  • PDF
Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods
  • 1,476
  • PDF
Implementing the Nelder-Mead simplex algorithm with adaptive parameters
  • 319
  • PDF
Nelder, Mead, and the other simplex method
  • 55
  • PDF
Fortified-Descent Simplicial Search Method: A General Approach
  • P. Tseng
  • Mathematics, Computer Science
  • SIAM J. Optim.
  • 1999
  • 80
...
1
2
3
4
5
...