A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
type: Item
instance of: scholarly article
title: A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
zbMATH Open document ID: 1391.90636
author: Gabriel Haeser
published in: Computational Optimization and Applications
publication date: 2018-06-13T00:00:00Z
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6887483
zbMATH Keywords: second-order optimality conditions
zbMATH Keywords: complementarity
zbMATH Keywords: global convergence
zbMATH Keywords: constraint qualifications
describes a project that uses: LANCELOT
describes a project that uses: ALGENCAN
MaRDI profile type: Publication
full work available at URL: s10589-018-0005-3
OpenAlex ID: W2796766994
Wikidata QID: Q111288278
cites work: A stabilized SQP method: global convergence
cites work: On Augmented Lagrangian Methods with General Lower-Level Constraints
cites work: Second-order negative-curvature methods for box-constrained and general constrained optimization
cites work: On sequential optimality conditions for smooth constrained optimization
cites work: Erratum “A second-order sequential optimality condition associated to the convergence of optimization algorithms”
cites work: Two New Weak Constraint Qualifications and Applications
cites work: A Cone-Continuity Constraint Qualification and Algorithmic Consequences
cites work: Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
cites work: On second-order optimality conditions for nonlinear programming
cites work: A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
cites work: Q3151174
cites work: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
cites work: Practical Augmented Lagrangian Methods for Constrained Optimization
cites work: Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
cites work: Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
cites work: The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
cites work: Q4503250
cites work: Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization''
cites work: Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
cites work: A new trust-region algorithm for equality constrained optimization
cites work: Q4023146
cites work: Trust Region Methods
cites work: On the Convergence Theory of Trust-Region-Based Algorithms for Equality-Constrained Optimization
cites work: Convergence to second-order stationary points in inequality constrained optimization
cites work: Q5588268
cites work: Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
cites work: On the global convergence of interior-pointnonlinear programming algorithms
cites work: Some theoretical limitations of second-order algorithms for smooth constrained optimization
cites work: A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems
cites work: Q3150781
cites work: Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions
cites work: An augmented Lagrangian interior-point method using directions of negative curvature
cites work: A primal-dual algorithm for nonlinear programming exploiting negative curvature directions
cites work: Convergence to Second-Order Stationary Points of a Primal-Dual Algorithm Model for Nonlinear Programming
cites work: Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
cites work: On affine scaling algorithms for nonconvex quadratic programming
cites work: On the complexity of approximating a KKT point of quadratic programming
DOI: 10.1007/S10589-018-0005-3
description: scientific article; zbMATH DE number 6887483