A sequential cutting plane algorithm for solving convex NLP problems
From MaRDI portal
Publication:2496070
DOI10.1016/j.ejor.2005.02.045zbMath1125.90038OpenAlexW2016771881WikidataQ114858777 ScholiaQ114858777MaRDI QIDQ2496070
Publication date: 30 June 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.02.045
Related Items
An overview of MINLP algorithms and their implementation in Muriqui optimizer ⋮ Solving convex MINLP optimization problems using a sequential cutting plane algorithm ⋮ A cutting plane algorithm for MV portfolio selection model ⋮ A linear programming-based optimization algorithm for solving nonlinear programming problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- Enlarging the region of convergence of Newton's method for constrained optimization
- Fast Fourier optimization
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- An approach to nonlinear programming
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- The Cutting-Plane Method for Solving Convex Programs