For the second time in a week, PRIMA ( https://t.co/COoqpAyxHp ) is on the front page of Hacker News! The first time was 16 May. Check it at
https://t.co/c0WTtBH0us
Thank everyone for the support and fantastic feedback!
SciPy: The Fortran 77 implementation of COBYLA is buggy and challenging to maintain. Switch to the PRIMA ( https://t.co/QFa0iVQGLX ) implementation?
https://t.co/mFjksoVE5T
This is fantastic! I look forward to seeing LFortran compiling PRIMA ( https://t.co/QFa0iVQGLX ), the inclusion of PRIMA into SciPy is under discussion and the SciPy contributors are positive about it ( https://t.co/mFjksoVE5T ).
PRIMA is a package for solving general nonlinear optimization problems without using derivatives. It provides the reference implementation of Powell's derivative-free optimization methods, i.e., COBYLA, UOBYQA, NEWUOA, BOBYQA, and LINCOA.
https://t.co/COoqpAyxHp
constrained optimization problems that admit equality and inequality constraints. An important feature of COBYQA is that it always respects bound constraints, if any, which is motivated by applications where the objective function is [6/9 of https://t.co/g2nzzLuJKt]
space of a surface. Finally, we elaborate on developing our new DFO method, named COBYQA after Constrained Optimization BY Quadratic Approximations. This derivative-free trust-region SQP method is designed to tackle nonlinearly [5/9 of https://t.co/g2nzzLuJKt]
undefined when bounds are violated. We expose extensive numerical experiments of COBYQA, showing evident advantages of COBYQA compared with Powell's DFO solvers. These experiments demonstrate that COBYQA is an excellent successor to [7/9 of https://t.co/g2nzzLuJKt]