Rates of convergence for a method of centers algorithm

DOI10.1007/BF00935704zbMath0299.65036MaRDI QIDQ1215256

S. Singh

Publication date: 1976

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

Mathematics Subject Classification ID

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

Related Items

A barrier function method for minimax problems, On complexity of the translational-cut algorithm for convex minimax problems, A feasible direction algorithm for convex optimization: Global convergence rates

Cites Work

• La méthode des centres dans un espace topologique
• The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
• Subproblem and Overall Convergence for a Method-of-Centers Algorithm
• Convergence bounds for nonlinear programming algorithms
• Pseudo-Convex Functions
• Pseudo-Concave Programming and Lagrange Regularity
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• Äquivalenz eines Optimierungsproblems mit Restriktionen und einer Folge von Optimierungsproblemen ohne Restriktionen
• The Sequential Unconstrained Minimization Technique (SUMT) Without Parameters
• The Slacked Unconstrained Minimization Technique for Convex Programming
• Convex Analysis
• Cutting-Plane Methods without Nested Constraint Sets
• On the rate of convergence of certain methods of centers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item