Self-tuning norm-relaxed method of feasible directions

DOI10.1023/A:1022655129695MaRDI QIDQ1367804zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

nonlinear programmingcomputational experimentsnumerical methodsmethods of feasible directions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 1925785
• A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
• scientific article; zbMATH DE number 4153791
• scientific article; zbMATH DE number 3892953

Cites work

• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• scientific article; zbMATH DE number 3562346 (Why is no real title available?)
• A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
• An Efficient Method of Feasible Directions
• Convergence analysis of norm-relaxed method of feasible directions
• Enhanced methods for feasible directions for engineering design problems
• Generalization of Murty's direct algorithm to linear and convex quadratic programming
• More test examples for nonlinear programming codes
• New convergence theorems for a class of feasible directions algorithms
• Norm-relaxed method of feasible directions for solving nonlinear programming problems
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• On the rate of convergence of certain methods of centers
• Rate of Convergence of a Class of Methods of Feasible Directions
• State-of-the-art in parallel nonlinear optimization
• Test examples for nonlinear programming codes

Cited in

(5)

• Probabilistic version of the method of feasible directions.
• 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
• Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization

This page was built for publication: Self-tuning norm-relaxed method of feasible directions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367804)