14 results
Search Results
2. A nonmonotone flexible filter method for nonlinear constrained optimization.
3. A Globally Convergent Penalty-Free Method for Optimization with Equality Constraints and Simple Bounds.
4. A new penalty-free-type algorithm based on trust region techniques
5. An active set limited memory BFGS algorithm for bound constrained optimization
6. A modified QP-free feasible method
7. Combining nonmonotone conic trust region and line search techniques for unconstrained optimization
8. Nonmonotone trust region algorithm for unconstrained optimization problems
9. A new feasible descent primal–dual interior point algorithm for nonlinear inequality constrained optimization
10. A new modified one-step smoothing Newton method for solving the general mixed complementarity problem
11. A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
12. A Sequential Quadratically Constrained Quadratic Programming Method of Feasible Directions.
13. A modified SQP method and its global convergence
14. A globally and superlinearly convergent feasible QP-free method for nonlinear programming
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.