A linear programming-based optimization algorithm for solving nonlinear programming problems
From MaRDI portal
Publication:1044083
DOI10.1016/j.ejor.2009.01.033zbMath1177.90291OpenAlexW1981112827MaRDI QIDQ1044083
Publication date: 10 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.01.033
Related Items (2)
Conservative scales in packing problems ⋮ An optimization method to estimate models with store-level data: a case study
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- A globally convergent method for nonlinear programming
- Fast Fourier optimization
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
- A sequential cutting plane algorithm for solving convex NLP problems
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- An approach to nonlinear programming
- A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- The Cutting-Plane Method for Solving Convex Programs
- Exact penalty functions in nonlinear programming
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Very large scale optimization by sequential convex programming
- A tree-search algorithm for mixed integer programming problems
- Benchmarking optimization software with performance profiles.
This page was built for publication: A linear programming-based optimization algorithm for solving nonlinear programming problems
