An improved feasible QP-free algorithm for inequality constrained optimization
type: Item
instance of: scholarly article
title: An improved feasible QP-free algorithm for inequality constrained optimization
zbMATH Open document ID: 1287.90073
publication date: 2013-03-12T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6143607
zbMATH Keywords: inequality constrained optimization
zbMATH Keywords: feasible QP-free method
zbMATH Keywords: system of linear equations
zbMATH Keywords: global convergence
zbMATH Keywords: superlinear convergence rate
author: Zhibin Zhu
author: Jinbao Jian
MaRDI profile type: Publication
full work available at URL: s10114-012-0561-x
OpenAlex ID: W2134341940
cites work: Q4840764
cites work: On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
cites work: Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
cites work: A sequential quadratic programming method for potentially infeasible mathematical programs
cites work: A successive quadratic programming algorithm with global and superlinear convergence properties
cites work: A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
cites work: A two-stage feasible directions algorithm for nonlinear constrained optimization
cites work: A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
cites work: A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
cites work: An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
cites work: A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization
cites work: A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
cites work: Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
cites work: Q3416530
cites work: Q5310315
cites work: Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
cites work: A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization
cites work: A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
cites work: Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
cites work: Test examples for nonlinear programming codes
DOI: 10.1007/S10114-012-0561-X
Recommended article: Q4901364
Recommended article: An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems
Recommended article: A new QP-free algorithm for inequality constrained optimization without strict complementarity
Recommended article: A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization
Recommended article: An improved SQP algorithm for inequality constrained optimization
Recommended article: An efficient feasible SQP algorithm for inequality constrained optimization
Recommended article: A QP-free and superlinearly convergent algorithm for inequality constrained optimizations
Recommended article: An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization
Recommended article: An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization
Recommended article: A simple feasible SQP algorithm for inequality constrained optimization
published in: Acta Mathematica Sinica, English Series
description: scientific article; zbMATH DE number 6143607