A superlinearly convergent method of feasible directions.
From MaRDI portal
Publication:5931665
DOI10.1016/S0096-3003(99)00176-9zbMath1112.90380MaRDI QIDQ5931665
Michael M. Kostreva, X. B. Chen
Publication date: 25 April 2001
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Engineering optimizationLinear convergence rateMethod of feasible directionsNonlinear optimizationSequential quadratic programmingSuperlinear convergence rate
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items (21)
A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity ⋮ A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity ⋮ New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate ⋮ A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization ⋮ A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization ⋮ A simple feasible SQP algorithm for inequality constrained optimization ⋮ A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints ⋮ A hybrid multilevel approach for aeroelastic optimization of composite wing-box ⋮ A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization ⋮ A variant of SQP method for inequality constrained optimization and its global convergence ⋮ A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization ⋮ A new SQP method of feasible directions for nonlinear programming. ⋮ Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems ⋮ A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming ⋮ A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems ⋮ A sequential equality constrained quadratic programming algorithm for inequality constrained optimization ⋮ A sequential quadratically constrained quadratic programming method of feasible directions ⋮ An efficient sequential quadratic programming algorithm for nonlinear programming ⋮ An active set sequential quadratic programming algorithm for nonlinear optimisation ⋮ A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization ⋮ A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Effective use of numerical optimization in structural design
- Enhanced methods for feasible directions for engineering design problems
- Test examples for nonlinear programming codes
- Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD
- A generalization of the norm-relaxed method of feasible directions
- Norm-relaxed method of feasible directions for solving nonlinear programming problems
- Convergence analysis of norm-relaxed method of feasible directions
- Self-tuning norm-relaxed method of feasible directions
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Rate of Convergence of a Class of Methods of Feasible Directions
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- On the rate of convergence of certain methods of centers
This page was built for publication: A superlinearly convergent method of feasible directions.
