An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments
type: Item
instance of: scholarly article
title: An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments
zbMATH Open document ID: 1220.65070
author: Xing-De Mo
author: Jinbao Jian
author: Su-Min Yang
published in: Applied Mathematics and Computation
publication date: 2011-04-19T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5880221
zbMATH Keywords: constrained optimization
zbMATH Keywords: sequential systems of linear equations (SSLE)
zbMATH Keywords: method of strongly sub-feasible directions
zbMATH Keywords: convergence
zbMATH Keywords: numerical experiments
zbMATH Keywords: bidirectional Armijo line
describes a project that uses: CUTEr
describes a project that uses: CUTE
MaRDI profile type: Publication
full work available at URL: j.amc.2011.02.012
OpenAlex ID: W2122230127
cites work: A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
cites work: Q4879594
cites work: Q4702075
cites work: Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
cites work: A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
cites work: Two extension models of SQP and SSLE algorithms for optimizaiton and their superlinear and quadratic convergence
cites work: Test examples for nonlinear programming codes
cites work: More test examples for nonlinear programming codes
cites work: CUTE
cites work: Q4151662
DOI: 10.1016/J.AMC.2011.02.012
Recommended article: An improved infeasible SSLE method for constrained optimization without strict complementarity
Recommended article: A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
Recommended article: Q3052589
Recommended article: A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems
Recommended article: A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints
Recommended article: Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
Recommended article: Q4950903
Recommended article: Q3002141
Recommended article: Q4487995
Recommended article: A strongly sub-feasible direction method with subgradient selection for nonsmooth optimization
description: scientific article; zbMATH DE number 5880221