A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints
From MaRDI portal
Publication:861188
DOI10.1016/j.amc.2006.04.049zbMath1108.65063OpenAlexW1965356522MaRDI QIDQ861188
Jin-Bao Jian, Dao Lan Han, Qing Juan Xu
Publication date: 9 January 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.04.049
algorithmglobal convergencestrong convergencenumerical examplesequality and inequality constraintsmethod of feasible direction
Related Items
Quadratically constraint quadratical algorithm model for nonlinear minimax problems, Primal-dual interior point QP-free algorithm for nonlinear constrained optimization, Optimal maximally decimated m-channel mirrored paraunitary linear phase FIR filter bank design via norm relaxed sequential quadratic programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- A globally convergent method for nonlinear programming
- A generalization of the norm-relaxed method of feasible directions
- Norm-relaxed method of feasible directions for solving nonlinear programming problems
- A new SQP method of feasible directions for nonlinear programming.
- A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- Multiplier and gradient methods
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
- A two-stage feasible directions algorithm for nonlinear constrained optimization
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- Feasible directions algorithms for optimization problems with equality and inequality constraints
- Combined phase I—phase II methods of feasible directions
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Rate of Convergence of a Class of Methods of Feasible Directions
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- A superlinearly convergent method of feasible directions.
