Pages that link to "Item:Q1148785"
From MaRDI portal
The following pages link to Test examples for nonlinear programming codes (Q1148785):
Displaying 50 items.
- A new technique for inconsistent QP problems in the SQP method (Q1298765) (← links)
- A reduced Hessian method for constrained optimization (Q1312087) (← links)
- Orthogonal and conjugate basis methods for solving equality constrained minimization problems (Q1312090) (← links)
- Equality and inequality constrained optimization algorithms with convergent stepsizes (Q1321310) (← links)
- Nonmonotone line search for minimax problems (Q1321311) (← links)
- A class of test functions for global optimization (Q1337132) (← links)
- A two-parameter exact penalty function for nonlinear programming (Q1337206) (← links)
- Corrected sequential linear programming for sparse minimax optimization (Q1338528) (← links)
- Norm-relaxed method of feasible directions for solving nonlinear programming problems (Q1338556) (← links)
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems (Q1356056) (← links)
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization (Q1363416) (← links)
- Self-tuning norm-relaxed method of feasible directions (Q1367804) (← links)
- Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints (Q1372561) (← links)
- Performance of several nonlinear programming software packages on microcomputers. (Q1406691) (← links)
- The dynamic-Q optimization method: an alternative to SQP? (Q1416366) (← links)
- Active set strategies in an ellipsoid algorithm for nonlinear programming (Q1433159) (← links)
- An efficient constraint handling method for genetic algorithms (Q1574382) (← links)
- Limited memory quasi-Newton method for large-scale linearly equality-constrained minimization (Q1582578) (← links)
- The LFOPC leap-frog algorithm for constrained optimization (Q1591934) (← links)
- An evaluation of back-propagation neural networks for the optimal design of structural systems. II: Numerical evaluation (Q1600799) (← links)
- Continuation method for nonlinear complementarity problems via normal maps (Q1610180) (← links)
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization (Q1616932) (← links)
- On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization (Q1633865) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach (Q1652420) (← links)
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results (Q1657404) (← links)
- An interior-point implementation developed and tuned for radiation therapy treatment planning (Q1687310) (← links)
- An LQP-based two-step method for structured variational inequalities (Q1697893) (← links)
- Order-based error for managing ensembles of surrogates in mesh adaptive direct search (Q1704921) (← links)
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
- An affine scaling interior trust-region method combining with line search filter technique for optimization subject to bounds on variables (Q1744045) (← links)
- Variable sample size method for equality constrained optimization problems (Q1749777) (← links)
- Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation (Q1751057) (← links)
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (Q1754299) (← links)
- An interior-point method for solving box-constrained underdetermined nonlinear systems (Q1763761) (← links)
- Levenberg-Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints (Q1765264) (← links)
- An efficient sequential quadratic programming algorithm for nonlinear programming (Q1765487) (← links)
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization (Q1769069) (← links)
- On the convergence of a trust-region method for solving constrained nonlinear equations with degenerate solutions (Q1771108) (← links)
- A feasible interior-point algorithm for nonconvex nonlinear programming (Q1774879) (← links)
- Fuzzy costs in quadratic programming problems (Q1794338) (← links)
- Value-estimation function method for constrained global optimization (Q1807822) (← links)
- Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions. (Q1810523) (← links)
- Nonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization (Q1811590) (← links)
- Global convergence of trust region algorithm for equality and bound constrained nonlinear optimization (Q1812223) (← links)
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
- On the resolution of monotone complementarity problems (Q1815077) (← links)
- On the convergence rate of Newton interior-point methods in the absence of strict complementarity (Q1816402) (← links)
- Computational methods for optimum design of large complex systems (Q1820022) (← links)
- Probabilistic version of the method of feasible directions. (Q1855739) (← links)
