A computational comparison of some non-linear programs

Cites work

scientific article; zbMATH DE number 3309655 (Why is no real title available?)
A New Method for Constrained Optimization Problems
A Rapidly Convergent Descent Method for Minimization
An integrated approach to structural synthesis and analysis
Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation
Optimization by Least Squares

Cited in

(26)

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

This page was built for publication: A computational comparison of some non-linear programs

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