Convergence analysis of norm-relaxed method of feasible directions

DOI10.1007/BF02190102zbMath0883.90101MaRDI QIDQ1359453

J. Korycki, Michael M. Kostreva

Publication date: 23 March 1998

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

superlinear convergenceasymptotic rate of convergencenorm-relaxed method of feasible directions

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items (7)

Self-tuning norm-relaxed method of feasible directions ⋮ Benchmark Problems in Structural Optimization ⋮ A superlinearly convergent method of feasible directions. ⋮ Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD ⋮ A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization ⋮ A generalization of the norm-relaxed method of feasible directions ⋮ Probabilistic version of the method of feasible directions.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enhanced methods for feasible directions for engineering design problems
• Generalization of Murty's direct algorithm to linear and convex quadratic programming
• New convergence theorems for a class of feasible directions algorithms
• On the rate of convergence of some feasible direction algorithms
• On the Pironneau-Polak method of centers
• A feasible direction algorithm for convex optimization: Global convergence rates
• Norm-relaxed method of feasible directions for solving nonlinear programming problems
• Matrix Analysis
• 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: Convergence analysis of norm-relaxed method of feasible directions