Convergence bounds for nonlinear programming algorithms

DOI10.1007/BF01580447MaRDI QIDQ4091726zbMATH OpenFDO

Authors Robert Mifflin

Publication date 1975

Published in Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Cites work

• Convex Analysis
• Cutting-Plane Methods without Nested Constraint Sets
• scientific article; zbMATH DE number 3116987 (Why is no real title available?)
• scientific article; zbMATH DE number 3159112 (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 3308846 (Why is no real title available?)
• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• scientific article; zbMATH DE number 3358258 (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 3423826 (Why is no real title available?)
• scientific article; zbMATH DE number 3067835 (Why is no real title available?)
• scientific article; zbMATH DE number 3111121 (Why is no real title available?)
• Pseudo-Concave Programming and Lagrange Regularity
• Pseudo-Convex Functions
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• The Pseudoinverse of a Rectangular or Singular Matrix and Its Application to the Solution of Systems of Linear Equations

Cited in

(5)

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

This page was built for publication: Convergence bounds for nonlinear programming algorithms

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