The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables

DOI10.1016/0022-247X(79)90050-7zbMath0409.90073MaRDI QIDQ1259272

Jai H. Eu, Mokhtar S. Bazaraa

Publication date: 1979

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

Computational EfficiencyNonlinear ProgrammingConvergence AnalysisisDirection AlgorithmFeasibleKuhn-Tucker PointLower and Upper Bounded VariablesNumerical Experience

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Study on a supermemory gradient method for the minimization of functions
• Quadratically convergent algorithms and one-dimensional search schemes
• `` Direct Search Solution of Numerical and Statistical Problems
• Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
• A Quasi-Newton Method with No Derivatives
• A Rapidly Convergent Descent Method for Minimization
• Function minimization by conjugate gradients
• A New Method of Constrained Optimization and a Comparison With Other Methods
• Nonlinear Programming with the Aid of a Multiple-Gradient Summation Technique
• Sequential Search: A Method for Solving Constrained Optimization Problems
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
• Convergence Conditions for Nonlinear Programming Algorithms
• A Simplex Method for Function Minimization
• Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation

This page was built for publication: The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables