Pages that link to "Item:Q5675160"
From MaRDI portal
The following pages link to A computational comparison of some non-linear programs (Q5675160):
Displayed 24 items.
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748) (← links)
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
- An extension of the Fletcher-Reeves method to linear equality constrained optimization problem (Q482439) (← links)
- A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← links)
- An active set smoothing method for solving unconstrained minimax problems (Q779576) (← links)
- The oracle penalty method (Q975775) (← links)
- Extended ant colony optimization for non-convex mixed integer nonlinear programming (Q1013399) (← links)
- A globally and quadratically convergent algorithm for general nonlinear programming problems (Q1151728) (← links)
- A comparative performance evaluation of 27 nonlinear programming codes (Q1171003) (← links)
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization (Q1205504) (← links)
- Minimization methods with constraints (Q1234628) (← links)
- Performance of several nonlinear programming software packages on microcomputers. (Q1406691) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems (Q1725277) (← links)
- Numerical experience with conjugate direction methods in constrained minimization (Q1825773) (← links)
- Unification of basic and composite nondifferentiable optimization (Q1924063) (← links)
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization (Q1946925) (← links)
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← links)
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization (Q2022218) (← links)
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications (Q3851986) (← links)
- Nonlinear programming via an exact penalty function: Global analysis (Q3967372) (← links)
- A negative-positive barrier method for non-linear programming (Q4116264) (← links)
- Nonlinear leastpth optimization and nonlinear programming (Q4152045) (← links)
- A first order, exact penalty function algorithm for equality constrained optimization problems (Q4181618) (← links)