A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints
type: Item
instance of: scholarly article
title: A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints
zbMATH Open document ID: 1097.90063
author: Jian-Ling Li
author: Jinbao Jian
published in: Journal of Global Optimization
publication date: 2006-02-20T00:00:00Z
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 5007667
zbMATH Keywords: algorithm
zbMATH Keywords: complementarity constraints
zbMATH Keywords: global convergence
zbMATH Keywords: sequential systems of linear equations
zbMATH Keywords: superlinear convergence
MaRDI profile type: Publication
full work available at URL: s10898-004-2708-5
OpenAlex ID: W1984345213
cites work: A Non-Interior-Point Continuation Method for Linear Complementarity Problems
cites work: A smoothing method for mathematical programs with equilibrium constraints
cites work: Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
cites work: A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
cites work: Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
cites work: Superlinearly convergent variable metric algorithms for general nonlinear programming problems
cites work: Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
cites work: Some Noninterior Continuation Methods for Linear Complementarity Problems
cites work: On optimization of systems governed by implicit complementarity problems*
cites work: A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
DOI: 10.1007/S10898-004-2708-5
description: scientific article; zbMATH DE number 5007667