Mixed integer nonlinear programming using interior-point methods
From MaRDI portal
Recommendations
- Using interior-point methods within an outer approximation framework for mixed integer nonlinear programming
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- Numerical experiments with an interior-exterior point method for nonlinear programming
- Globally convergent interior-point algorithm for nonlinear programming
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis
- An algorithmic framework for convex mixed integer nonlinear programs
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- An interior-point algorithm for nonconvex nonlinear programming
- BARON: A general purpose global optimization software package
- Derived data structure algorithms for unstructured finite element meshes
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- Interior-point algorithms, penalty methods and equilibrium problems
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
- LOQO user's manual — version 3.10
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Reoptimization With the Primal-Dual Interior Point Method
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Warm-start strategies in interior-point methods for linear programming
Cited in
(12)- Using the analytic center in the feasibility pump
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- Numerical experiments with an interior-exterior point method for nonlinear programming
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
- Smoothing and regularization for mixed-integer second-order cone programming with applications in portfolio optimization
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Exact and fast algorithms for mixed-integer nonlinear programming
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Application-oriented mixed integer non-linear programming
- A hybrid branch-and-bound and interior-point algorithm for stochastic mixed-integer nonlinear second-order cone programming
- scientific article; zbMATH DE number 786571 (Why is no real title available?)
- Using interior-point methods within an outer approximation framework for mixed integer nonlinear programming
This page was built for publication: Mixed integer nonlinear programming using interior-point methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096887)
