A computational comparison of some non-linear programs

DOI10.1007/BF01584657zbMath0259.90044MaRDI QIDQ5675160

Jonathan A. Asaadi

Publication date: 1973

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

Mathematics Subject Classification ID

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

Related Items

Nonlinear programming via an exact penalty function: Global analysis ⋮ Best practices for comparing optimization algorithms ⋮ Unification of basic and composite nondifferentiable optimization ⋮ A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization ⋮ Performance of several nonlinear programming software packages on microcomputers. ⋮ A globally and quadratically convergent algorithm for general nonlinear programming problems ⋮ A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization ⋮ Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions ⋮ A comparative performance evaluation of 27 nonlinear programming codes ⋮ Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems ⋮ An extension of the Fletcher-Reeves method to linear equality constrained optimization problem ⋮ A negative-positive barrier method for non-linear programming ⋮ A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization ⋮ A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization ⋮ A dynamic convexized method for nonconvex mixed integer nonlinear programming ⋮ Acceleration of the leastpth algorithm for minimax optimization with engineering applications ⋮ The oracle penalty method ⋮ A filter proximal bundle method for nonsmooth nonconvex constrained optimization ⋮ Nonlinear leastpth optimization and nonlinear programming ⋮ Minimization methods with constraints ⋮ A first order, exact penalty function algorithm for equality constrained optimization problems ⋮ Extended ant colony optimization for non-convex mixed integer nonlinear programming ⋮ Numerical experience with conjugate direction methods in constrained minimization ⋮ An active set smoothing method for solving unconstrained minimax problems

Cites Work

• Unnamed Item
• An integrated approach to structural synthesis and analysis
• A Rapidly Convergent Descent Method for Minimization
• Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation
• Optimization by Least Squares
• A New Method for Constrained Optimization Problems