Mixed integer nonlinear programming using interior-point methods
From MaRDI portal
Publication:3096887
DOI10.1080/10556781003799303zbMath1229.90103OpenAlexW2086315840MaRDI QIDQ3096887
Publication date: 15 November 2011
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556781003799303
Related Items
Minotaur: a mixed-integer nonlinear optimization toolkit, Using the analytic center in the feasibility pump, Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Interior-point algorithms, penalty methods and equilibrium problems
- An algorithmic framework for convex mixed integer nonlinear programs
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- An interior-point algorithm for nonconvex nonlinear programming
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- BARON: A general purpose global optimization software package
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- Warm-Start Strategies in Interior-Point Methods for Linear Programming
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis
- Reoptimization With the Primal-Dual Interior Point Method
- LOQO user's manual — version 3.10
- Derived data structure algorithms for unstructured finite element meshes
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
