Pages that link to "Item:Q1111932"
From MaRDI portal
The following pages link to More test examples for nonlinear programming codes (Q1111932):
Displaying 50 items.
- A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization (Q979825) (← links)
- Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms (Q995933) (← links)
- A new finitely convergent algorithm for systems of nonlinear inequalities (Q1001117) (← links)
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (Q1004010) (← links)
- Solving constrained optimization problems using a novel genetic algorithm (Q1004192) (← links)
- An affine scaling optimal path method with interior backtracking curvilinear technique for linear constrained optimization (Q1004230) (← links)
- An XML-based schema for stochastic programs (Q1026581) (← links)
- Nonmonotonic reduced projected Hessian method via an affine scaling interior modified gradient path for bounded-constrained optimization (Q1031969) (← links)
- Pattern search ranking and selection algorithms for mixed variable simulation-based optimization (Q1042073) (← links)
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
- A linear programming-based optimization algorithm for solving nonlinear programming problems (Q1044083) (← links)
- An analytical approach to global optimization (Q1181733) (← links)
- A collection of test problems for constrained global optimization algorithms (Q1188890) (← links)
- Modified partial-update Newton-type algorithms for unary optimization (Q1265009) (← links)
- Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD (Q1280097) (← links)
- An SQP method for general nonlinear programs using only equality constrained subproblems (Q1290629) (← links)
- A generalization of the norm-relaxed method of feasible directions (Q1294211) (← links)
- An approximate approach of global optimization for polynomial programming problems (Q1296128) (← links)
- A new technique for inconsistent QP problems in the SQP method (Q1298765) (← links)
- Handbook of test problems in local and global optimization (Q1304172) (← links)
- Scaled optimal path trust-region algorithm (Q1306663) (← links)
- Exploiting additional structure in equality constrained optimization by structured SQP secant algorithms (Q1321339) (← links)
- A class of nonmonotone stabilization trust region methods (Q1337634) (← links)
- Norm-relaxed method of feasible directions for solving nonlinear programming problems (Q1338556) (← links)
- A new heuristic algorithm for probabilistic optimization (Q1362975) (← links)
- Self-tuning norm-relaxed method of feasible directions (Q1367804) (← links)
- Nonmonotone Levenberg-Marquardt algorithms and their convergence analysis (Q1367810) (← links)
- Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints (Q1372561) (← links)
- A new approach to stochastic programming problems: Discrete model (Q1388844) (← links)
- Performance of several nonlinear programming software packages on microcomputers. (Q1406691) (← links)
- Sequential systems of linear equations algorithm for nonlinear optimization problems -- general constrained problems. (Q1412598) (← links)
- Test problem generator by neural network for algorithms that try solving nonlinear programming problems globally (Q1580431) (← links)
- Reformulating the traffic equilibrium problem via a smooth gap function. (Q1597124) (← links)
- On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization (Q1633865) (← links)
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results (Q1657404) (← links)
- A derivative-free trust region algorithm with nonmonotone filter technique for bound constrained optimization (Q1721017) (← links)
- Fuzzy costs in quadratic programming problems (Q1794338) (← links)
- Some experiments on heuristic code selection versus numerical performance in nonlinear programming (Q1804054) (← links)
- Nonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization (Q1811590) (← links)
- Numerical comparisons of path-following strategies for a primal-dual interior-point method for nonlinear programming (Q1862179) (← links)
- Adaptive algorithm for constrained least-squares problems (Q1862189) (← links)
- A trust-region algorithm for equality-constrained optimization via a reduced dimension approach. (Q1872933) (← links)
- Constrained optimization involving expensive function evaluations: A sequential approach (Q1887871) (← links)
- A two-piece update of projected Hessian algorithm with nonmonotonic trust region method for constrained optimization (Q1888512) (← links)
- An ODE-based approach to nonlinearly constrained minimax problems (Q1893526) (← links)
- Computing global minima to polynomial optimization problems using Gröbner bases (Q1904644) (← links)
- Integral global minimization: Algorithms, implementations and numerical tests (Q1913610) (← links)
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization (Q1915809) (← links)
- On the formulation and theory of the Newton interior-point method for nonlinear programming (Q1918017) (← links)
- Obtaining test problems via Internet (Q1918988) (← links)
