Convergence bounds for nonlinear programming algorithms

DOI10.1007/BF01580447zbMath0326.90055MaRDI QIDQ4091726

Robert Mifflin

Publication date: 1975

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items

A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds, Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications, On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method, Rates of convergence for a method of centers algorithm, Funciones penalidad y lagrangianos aumentados

Cites Work

• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Pseudo-Convex Functions
• Pseudo-Concave Programming and Lagrange Regularity
• Convex Analysis
• Cutting-Plane Methods without Nested Constraint Sets
• The Pseudoinverse of a Rectangular or Singular Matrix and Its Application to the Solution of Systems of Linear Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item