A trajectory-based method for mixed integer nonlinear programming problems
type: Item
instance of: scholarly article
title: A trajectory-based method for mixed integer nonlinear programming problems
zbMATH Open document ID: 1393.90075
author: Terry-Leigh Oliphant
author: M. Montaz Ali
published in: Journal of Global Optimization
publication date: 2018-03-13T00:00:00Z
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6849599
zbMATH Keywords: trajectory-based method
zbMATH Keywords: mixed integer nonlinear programming
zbMATH Keywords: system of ordinary differential equations
zbMATH Keywords: neighborhood
zbMATH Keywords: local minimizer
zbMATH Keywords: subproblem
zbMATH Keywords: pattern search
describes a project that uses: OPTIMA
describes a project that uses: AlphaECP
MaRDI profile type: Publication
full work available at URL: s10898-017-0570-5
OpenAlex ID: W2757608017
cites work: Optimization Methods in Finance
cites work: Nonlinear optimization with engineering applications
cites work: A tree-search algorithm for mixed integer programming problems
cites work: Integrating SQP and branch-and-bound for mixed integer nonlinear programming
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
cites work: Solving mixed integer nonlinear programs by outer approximation
cites work: FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
cites work: An interior point cutting plane heuristic for mixed integer programming
cites work: An exact penalty global optimization approach for mixed-integer programming problems
cites work: A note on convex reformulation schemes for mixed integer quadratic programs
cites work: Transformation-based preprocessing for mixed-integer quadratic programs
cites work: Linear transformation based solution methods for non-convex mixed integer quadratic programs
cites work: A new and dynamic method for unconstrained minimization
cites work: An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
cites work: Numerical Optimization
cites work: Optimal Order and Stepsize Sequences
cites work: The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
cites work: Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
cites work: Q4435425
cites work: Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
cites work: Q4331736
cites work: A global optimization algorithm for linear fractional and bilinear programs
cites work: Handbook of test problems in local and global optimization
DOI: 10.1007/S10898-017-0570-5
description: scientific article; zbMATH DE number 6849599