Pages that link to "Item:Q2496070"
From MaRDI portal
The following pages link to A sequential cutting plane algorithm for solving convex NLP problems (Q2496070):
Displaying 11 items.
- An optimal variant of Kelley's cutting-plane method (Q344947) (← links)
- Cutting sphere algorithm (Q597178) (← links)
- A cutting plane algorithm for MV portfolio selection model (Q1036539) (← links)
- A linear programming-based optimization algorithm for solving nonlinear programming problems (Q1044083) (← links)
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming (Q1327215) (← links)
- A nontangential cutting plane algorithm (Q1612001) (← links)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← links)
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm (Q2200088) (← links)
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191) (← links)
- Cutting plane algorithms for robust conic convex optimization problems (Q3423595) (← links)
- A Sequential Linear Constraint Programming Algorithm for NLP (Q4899011) (← links)