Self-tuning norm-relaxed method of feasible directions
From MaRDI portal
Publication:1367804
DOI10.1023/A:1022655129695zbMath0886.90128OpenAlexW76205916MaRDI QIDQ1367804
J. Korycki, Michael M. Kostreva
Publication date: 19 April 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022655129695
Related Items (4)
A superlinearly convergent method of feasible directions. ⋮ Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD ⋮ A generalization of the norm-relaxed method of feasible directions ⋮ Probabilistic version of the method of feasible directions.
Cites Work
- Unnamed Item
- Unnamed Item
- Enhanced methods for feasible directions for engineering design problems
- State-of-the-art in parallel nonlinear optimization
- Generalization of Murty's direct algorithm to linear and convex quadratic programming
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- New convergence theorems for a class of feasible directions algorithms
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- Norm-relaxed method of feasible directions for solving nonlinear programming problems
- Convergence analysis of norm-relaxed method of feasible directions
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- An Efficient Method of Feasible Directions
- 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: Self-tuning norm-relaxed method of feasible directions
