SQPDFO – A trust-region based algorithm for generally-constrained derivative-free optimization | Zendy

Anke Tröltzsch | Zendy; Časlav Ilić | Zendy; Martin Siggel | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

SQPDFO – A trust-region based algorithm for generally-constrained derivative-free optimization

Author(s) -

Anke Tröltzsch,

Časlav Ilić,

Martin Siggel

Publication year - 2022

Publication title -

aip conference proceedings

Language(s) - English

Resource type - Conference proceedings

SCImago Journal Rank - 0.177

H-Index - 75

eISSN - 1551-7616

pISSN - 0094-243X

DOI - 10.1063/5.0105349

Subject(s) - mathematical optimization , computer science , sequential quadratic programming , derivative free optimization , trust region , interpolation (computer graphics) , optimization problem , nonlinear programming , engineering optimization , continuous optimization , test functions for optimization , constrained optimization , quadratic programming , algorithm , nonlinear system , mathematics , meta optimization , multi swarm optimization , animation , physics , computer graphics (images) , computer security , quantum mechanics , radius

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research