共 50 条
- [31] New Coefficient of Three-Term Conjugate Gradient Method for Solving Unconstrained Optimization Problems [J]. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES AND TECHNOLOGY 2018 (MATHTECH 2018): INNOVATIVE TECHNOLOGIES FOR MATHEMATICS & MATHEMATICS FOR TECHNOLOGICAL INNOVATION, 2019, 2184
- [32] An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems [J]. OPTIMIZATION METHODS & SOFTWARE, 2013, 28 (03): : 424 - 441
- [33] A Sparse Quasi-Newton Method Based on Automatic Differentiation for Solving Unconstrained Optimization Problems [J]. SYMMETRY-BASEL, 2021, 13 (11):
- [35] RECON - A method for reducing computation time in numerical reload pattern optimization [J]. ANNUAL MEETING ON NUCLEAR TECHNOLOGY '99, PROCEEDINGS, 1998, : 53 - 56
- [37] An Efficient Single-Parameter Scaling Memoryless Broyden-Fletcher-Goldfarb-Shanno Algorithm for Solving Large Scale Unconstrained Optimization Problems [J]. IEEE ACCESS, 2020, 8 (08): : 85664 - 85674
- [38] A PRP-HS Type Hybrid Nonlinear Conjugate Gradient Method for Solving Unconstrained Optimization Problems [J]. INTELLIGENT SYSTEMS APPLICATIONS IN SOFTWARE ENGINEERING, VOL 1, 2019, 1046 : 58 - 68
- [39] A Numerical Study for Solving Unconstrained Optimization Problems Using Method of Three-Term Conjugate Gradient [J]. PROCEEDING OF THE 2ND 2022 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING (CSASE 2022), 2022, : 127 - 131