FEASIBLE DESCENT CONE METHODS FOR INEQUALITY CONSTRAINED OPTIMIZATION PROBLEMS
From MaRDI portal
Publication:4360561
DOI<1341::AID-NME907>3.0.CO;2-J 10.1002/(SICI)1097-0207(19960430)39:8<1341::AID-NME907>3.0.CO;2-JzbMath0887.73078OpenAlexW2046704641MaRDI QIDQ4360561
Nielen Stander, Johannes Arnoldus Snyman
Publication date: 25 May 1998
Full work available at URL: https://doi.org/10.1002/(sici)1097-0207(19960430)39:8<1341::aid-nme907>3.0.co;2-j
nonlinear objective functionsalgorithm SSOPT2approximate quadratic subproblemscentral descent rayinterior minimum
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Test examples for nonlinear programming codes
- Trust region methods for structural optimization using exact second order sensitivity
- A new first‐order interior feasible direction method for structural optimization
- New successive approximation method for optimum structural design
- On the robustness and efficiency of the SAM algorithm for structural optimization
- Function minimization by conjugate gradients
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
This page was built for publication: FEASIBLE DESCENT CONE METHODS FOR INEQUALITY CONSTRAINED OPTIMIZATION PROBLEMS
