Rates of convergence for a method of centers algorithm

DOI10.1007/BF00935704MaRDI QIDQ1215256zbMATH OpenFDO

Authors S. Singh, R. Mifflin

Publication date 1976

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

Full work available at URL https://doi.org/10.1007/BF00935704

Mathematics Subject Classification ID

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

Cites work

• Convergence bounds for nonlinear programming algorithms
• Convex Analysis
• Cutting-Plane Methods without Nested Constraint Sets
• scientific article; zbMATH DE number 3483800 (Why is no real title available?)
• scientific article; zbMATH DE number 3253619 (Why is no real title available?)
• scientific article; zbMATH DE number 3272538 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• scientific article; zbMATH DE number 3366713 (Why is no real title available?)
• scientific article; zbMATH DE number 3366714 (Why is no real title available?)
• scientific article; zbMATH DE number 3366721 (Why is no real title available?)
• scientific article; zbMATH DE number 3383729 (Why is no real title available?)
• scientific article; zbMATH DE number 3407464 (Why is no real title available?)
• scientific article; zbMATH DE number 3111121 (Why is no real title available?)
• La méthode des centres dans un espace topologique
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• On the rate of convergence of certain methods of centers
• Pseudo-Concave Programming and Lagrange Regularity
• Pseudo-Convex Functions
• Subproblem and Overall Convergence for a Method-of-Centers Algorithm
• The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
• The Sequential Unconstrained Minimization Technique (SUMT) Without Parameters
• The Slacked Unconstrained Minimization Technique for Convex Programming
• Äquivalenz eines Optimierungsproblems mit Restriktionen und einer Folge von Optimierungsproblemen ohne Restriktionen

Cited in

(3)

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

This page was built for publication: Rates of convergence for a method of centers algorithm

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