Convergence detection for optimization algorithms: approximate-KKT stopping criterion when Lagrange multipliers are not available
type: Item
instance of: scholarly article
title: Convergence detection for optimization algorithms: approximate-KKT stopping criterion when Lagrange multipliers are not available
zbMATH Open document ID: 1408.90281
author: Gabriel Haeser
author: Vinícius V. de Melo
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6945395
zbMATH Keywords: optimality conditions
zbMATH Keywords: optimization algorithms
zbMATH Keywords: stopping criteria
zbMATH Keywords: genetic algorithms
MaRDI profile type: Publication
full work available at URL: j.orl.2015.06.009
OpenAlex ID: W2460172031
cites work: On Augmented Lagrangian Methods with General Lower-Level Constraints
cites work: On sequential optimality conditions for smooth constrained optimization
cites work: Two New Weak Constraint Qualifications and Applications
cites work: Q3151174
cites work: Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
cites work: Trust Region Methods
cites work: An efficient constraint handling method for genetic algorithms
cites work: Q4692508
cites work: Q4879581
cites work: The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
cites work: A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables
DOI: 10.1016/J.ORL.2015.06.009
description: scientific article; zbMATH DE number 6945395