The application of gradient-only optimization methods for problems discretized using non-constant methods

DOI10.1007/S00158-009-0389-XMaRDI QIDQ381398zbMATH OpenOpenAlexFDO

Authors Schalk Kok, Albert A. Groenwold, Daniel N. 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

zbMATH Keywords

partial differential equationgradient-only optimizationnon-constant discretizationstep discontinuity

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Methods of reduced gradient type (90C52) Optimization problems in solid mechanics (74P99)

Recommendations

• Gradient-only approaches to avoid spurious local minima in unconstrained optimization
• Numerical methods for optimizing discontinuous functions
• scientific article; zbMATH DE number 891145
• Numerical methods for solutions of discontinuous extremal problems
• scientific article; zbMATH DE number 2208426

Cites work

• A Simple Mesh Generator in MATLAB
• A class of globally convergent optimization methods based on conservative convex separable approximations
• A gradient-only line search method for the conjugate gradient method applied to constrained optimization problems with severe noise in the objective function
• A new and dynamic method for unconstrained minimization
• A quadratically convergent unstructured remeshing strategy for shape optimization
• Design and analysis of computer experiments. With comments and a rejoinder by the authors
• Efficent line search algorithm for unconstrained optimization
• Incomplete series expansion for function approximation
• Numerical methods for large-scale nonlinear optimization
• Practical mathematical optimization. An introduction to basic optimization theory and classical and new gradient-based algorithms.
• Structural optimization using sensitivity analysis and a level-set method.
• The dynamic-Q optimization method: an alternative to SQP?
• The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches

Cited in

(3)

• A generic strategy to obtain semi-analytical mesh sensitivities/velocities for tetrahedral mesh generators
• Gradient-only approaches to avoid spurious local minima in unconstrained optimization
• Relaxed error control in shape optimization that utilizes remeshing

Describes a project that uses

Uses Software

• DistMesh
• L-BFGS

This page was built for publication: The application of gradient-only optimization methods for problems discretized using non-constant methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q381398)