The application of gradient-only optimization methods for problems discretized using non-constant methods
DOI10.1007/s00158-009-0389-xzbMath1274.90498OpenAlexW1985499370MaRDI QIDQ381398
Schalk Kok, Albert A. Groenwold, Daniel Nicolas Wilke
Publication date: 15 November 2013
Published in: Structural and Multidisciplinary Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00158-009-0389-x
partial differential equationgradient-only optimizationnon-constant discretizationstep discontinuity
Numerical optimization and variational techniques (65K10) Optimization problems in solid mechanics (74P99) Methods of reduced gradient type (90C52)
Related Items (2)
Uses Software
Cites Work
- Incomplete series expansion for function approximation
- A new and dynamic method for unconstrained minimization
- The dynamic-Q optimization method: an alternative to SQP?
- Structural optimization using sensitivity analysis and a level-set method.
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- Practical mathematical optimization. An introduction to basic optimization theory and classical and new gradient-based algorithms.
- Efficent line search algorithm for unconstrained optimization
- A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations
- A quadratically convergent unstructured remeshing strategy for shape optimization
- Numerical methods for large-scale nonlinear optimization
- A Simple Mesh Generator in MATLAB
- A gradient-only line search method for the conjugate gradient method applied to constrained optimization problems with severe noise in the objective function
- The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches
This page was built for publication: The application of gradient-only optimization methods for problems discretized using non-constant methods
