.png){kind=icon}
Return
Algorithm 1053: SOLNP+: A Derivative-Free Solver for Constrained Nonlinear Optimization
.png){kind=icon}
OA
AI
DOI：10.1145/3699956.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
SOLNP+ is a derivative-free solver for constrained nonlinear optimization. It starts from SOLve Nonlinear Programming (SOLNP) proposed in 1989 by Ye. The main ideas are to use finite difference to approximate the gradient of the objective function and constraints, and use augmented Lagrangian method and sequential quadratic programming to deal with nonlinear constraints. We incorporate the techniques of implicit filtering, a new restart mechanism, and a modern quadratic programming solver into this new version with an ANSI C implementation. The algorithm exhibits a great advantage in running time and robustness under noise compared with the old version implemented in MATLAB. The numerical experiments show that SOLNP+ is comparable with two widely used solvers, COBYLA and NOMAD. SOLNP+ is available at https://github.com/ COPT-Public/SOLNP_plus.
Keywords:
Derivative-free optimization
Implicit filtering
Optimization software
Journal
IF:
3.2
Papers:
35
Citations:
5.1K
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSaveA Tumor Growth Inhibition Model for Low-Grade Glioma Treated with Chemotherapy or Radiotherapy.png)
CLINICAL CANCER RESEARCH
OAAI
CLINICAL CANCER RESEARCHIF10.2
OAAIShareSaveShareSaveShareSaveShareSave
View more