A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
type: Item
instance of: scholarly article
title: A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
zbMATH Open document ID: 1263.90003
author: Oliver Exler
author: Thomas Lehmann
author: Klaus Schittkowski
published in: Mathematical Programming Computation
publication date: 2013-04-10T00:00:00Z
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C55
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6152668
zbMATH Keywords: MINLP
zbMATH Keywords: mixed-integer nonlinear programming
zbMATH Keywords: SQP
zbMATH Keywords: sequential quadratic programming
zbMATH Keywords: trust region method
zbMATH Keywords: linear outer approximation
zbMATH Keywords: MIQP
zbMATH Keywords: mixed-integer quadratic programming
zbMATH Keywords: numerical algorithms
zbMATH Keywords: performance evaluation
zbMATH Keywords: mixed-integer test problems
zbMATH Keywords: engineering optimization
describes a project that uses: LaGO
describes a project that uses: Bonmin
describes a project that uses: Ipopt
describes a project that uses: AlphaECP
describes a project that uses: QL
describes a project that uses: MISQP
describes a project that uses: MINLP
describes a project that uses: Couenne
describes a project that uses: MINLPB4
describes a project that uses: MISQPOA
describes a project that uses: MIQL
describes a project that uses: BARON
describes a project that uses: Schittkowski
describes a project that uses: MINLPLib
describes a project that uses: NLPQL
describes a project that uses: BFOUR
describes a project that uses: ZQPCVX
MaRDI profile type: Publication
full work available at URL: s12532-012-0045-0
OpenAlex ID: W2081760210
cites work: A computational comparison of some non-linear programs
cites work: Pattern search algorithms for mixed variable programming
cites work: Q5737099
cites work: Branching and bounds tighteningtechniques for non-convex MINLP
cites work: Algorithms and Software for Convex Mixed Integer Nonlinear Programs
cites work: An improved branch and bound algorithm for mixed integer nonlinear programs
cites work: Optimal design of electronic components by mixed-integer nonlinear programming
cites work: MINLPLib -- a collection of test models for mixed-integer nonlinear programming
cites work: A nonmonotone trust-region algorithm with nonmonotone penalty parameters for constrained optimization
cites work: Trust Region Methods
cites work: Nonmonotonic trust region algorithm
cites work: Benchmarking optimization software with performance profiles.
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
cites work: A trust region SQP algorithm for mixed-integer nonlinear programming
cites work: A new approach to variable metric algorithms
cites work: Solving mixed integer nonlinear programs by outer approximation
cites work: Q4331736
cites work: A successive quadratic programming algorithm with global and superlinear convergence properties
cites work: A numerically stable dual method for solving strictly convex quadratic programs
cites work: Review of nonlinear mixed-integer and disjunctive programming techniques
cites work: Q4371068
cites work: Branch and Bound Experiments in Convex Nonlinear Integer Programming
cites work: Integrating SQP and branch-and-bound for mixed integer nonlinear programming
cites work: Q3340639
cites work: Global Optimization and Constraint Satisfaction
cites work: A scaling method for priorities in hierarchical structures
cites work: Nonlinear programming codes. Information, tests, performance
cites work: A polyhedral branch-and-cut approach to global optimization
cites work: Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
cites work: Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
cites work: On the convergence of a new trust region algorithm
DOI: 10.1007/S12532-012-0045-0

A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization (cites work)
cites work: A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization