A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization (Q2841139): Difference between revisions

Latest revision as of 15:35, 6 July 2024

scientific article

Language	Label	Description	Also known as
English	A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization	scientific article

Statements

instance of

scholarly article

0 references

title

A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization (English)

0 references

0 references

0 references

0 references

0 references

24 July 2013

0 references

zbMATH Keywords

sequential quadratically constrained quadratic programming

0 references

systems of linear equations

0 references

strongly sub-feasible directions

0 references

second-order approximate condition

0 references

global convergence

0 references

rate of convergence

0 references

describes a project that uses

Mosek

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/02331934.2011.611514

0 references

cites work

Norm-relaxed method of feasible directions for solving nonlinear programming problems

0 references

A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization

0 references

New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate

0 references

A sequential quadratically constrained quadratic programming method of feasible directions

0 references

A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization

0 references

Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions

0 references

A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization

0 references

A type of efficient feasible SQP algorithms for inequality constrained optimization

0 references

Convergence analysis of norm-relaxed method of feasible directions

0 references

A superlinearly convergent method of feasible directions.

0 references

A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm

0 references

A surperlinearly convergent algorithm for constrained optimization problems

0 references

Rate of Convergence of a Class of Methods of Feasible Directions

0 references

On the Sequential Quadratically Constrained Quadratic Programming Methods

0 references

A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function

0 references

Identifiers

zbMATH Open document ID

1273.90202

0 references

DOI

10.1080/02331934.2011.611514

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2841139

@@ Property / author @@
-Jin-Bao Jian
@@ Property / author: Jin-Bao Jian / rank @@
-Normal rank
@@ Property / author @@
-Chun-Ming Tang
@@ Property / author: Chun-Ming Tang / rank @@
-Normal rank
@@ Property / author @@
+Jin-Bao Jian
@@ Property / author: Jin-Bao Jian / rank @@
+Normal rank
@@ Property / author @@
+Chun-Ming Tang
@@ Property / author: Chun-Ming Tang / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Mosek
@@ Property / describes a project that uses: Mosek / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/02331934.2011.611514
+Normal rank
@@ Property / OpenAlex ID @@
+W2022619808
@@ Property / OpenAlex ID: W2022619808 / rank @@
+Normal rank
@@ Property / cites work @@
+Norm-relaxed method of feasible directions for solving nonlinear programming problems
+Normal rank
@@ Property / cites work @@
+A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
+Normal rank
@@ Property / cites work @@
+New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
+Normal rank
@@ Property / cites work @@
+A sequential quadratically constrained quadratic programming method of feasible directions
+Normal rank
@@ Property / cites work @@
+A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
+Normal rank
@@ Property / cites work @@
+Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
+Normal rank
@@ Property / cites work @@
+A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
+Normal rank
@@ Property / cites work @@
+A type of efficient feasible SQP algorithms for inequality constrained optimization
+Normal rank
@@ Property / cites work @@
+Convergence analysis of norm-relaxed method of feasible directions
+Normal rank
@@ Property / cites work @@
+A superlinearly convergent method of feasible directions.
+Normal rank
@@ Property / cites work @@
+A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
+Normal rank
@@ Property / cites work @@
+A surperlinearly convergent algorithm for constrained optimization problems
+Normal rank
@@ Property / cites work @@
+Rate of Convergence of a Class of Methods of Feasible Directions
+Normal rank
@@ Property / cites work @@
+On the Sequential Quadratically Constrained Quadratic Programming Methods
+Normal rank
@@ Property / cites work @@
+A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function
+Normal rank