The following pages link to Computing a Trust Region Step (Q3343340):
Displayed 50 items.
- GQTPAR (Q19481) (← links)
- CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm (Q557727) (← links)
- A direct active set algorithm for large sparse quadratic programs with simple bounds (Q583116) (← links)
- MANPAK: A set of algorithms for computations on implicitly defined manifolds (Q679290) (← links)
- A continuous approach to inductive inference (Q687090) (← links)
- An iterative method for solving semismooth equations (Q697540) (← links)
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization (Q700746) (← links)
- An interior affine scaling projective algorithm for nonlinear equality and linear inequality constrained optimization (Q704177) (← links)
- A restricted trust region algorithm for unconstrained optimization (Q761253) (← links)
- Interior-point algorithms for global optimization (Q804475) (← links)
- Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
- Convergence rate of the trust region method for nonlinear equations under local error bound condition (Q853546) (← links)
- A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy (Q864760) (← links)
- A modified nearly exact method for solving low-rank trust region subproblem (Q868456) (← links)
- Projected quasi-Newton algorithm with trust region for constrained optimization (Q911465) (← links)
- Convergence properties of trust region methods for linear and convex constraints (Q922951) (← links)
- On a subproblem of trust region algorithms for constrained optimization (Q922954) (← links)
- An algorithm for solving new trust region subproblem with conic model (Q931513) (← links)
- On solving \(L_{q}\)-penalized regressions (Q933880) (← links)
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls (Q946350) (← links)
- Regularization using a parameterized trust region subproblem (Q959940) (← links)
- Variable-number sample-path optimization (Q959964) (← links)
- A new zero-finder for Tikhonov regularization (Q960039) (← links)
- An affine scaling optimal path method with interior backtracking curvilinear technique for linear constrained optimization (Q1004230) (← links)
- A new predictor-corrector method for solving unconstrained minimization problems (Q1084839) (← links)
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces (Q1107449) (← links)
- Parallel quasi-Newton methods for unconstrained optimization (Q1116897) (← links)
- A constrained eigenvalue problem (Q1117002) (← links)
- Algorithms for bound constrained quadratic programming problems (Q1122320) (← links)
- A hybrid method for the nonlinear least squares problem with simple bounds (Q1177199) (← links)
- An interior point algorithm to solve computationally difficult set covering problems (Q1181917) (← links)
- Nonmonotone trust region methods with curvilinear path in unconstrained optimization (Q1195967) (← links)
- Computation of a trust region step (Q1198611) (← links)
- A quasi-Gauss-Newton method for solving nonlinear algebraic equations (Q1203697) (← links)
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization (Q1205504) (← links)
- Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid (Q1278289) (← links)
- A framework for globally convergent algorithms using gradient bounding functions (Q1289400) (← links)
- Tensor methods for large sparse systems of nonlinear equations (Q1290627) (← links)
- Advances in trust region algorithms for constrained optimization (Q1294548) (← links)
- Scaled optimal path trust-region algorithm (Q1306663) (← links)
- A model trust-region modification of Newton's method for nonlinear two- point boundary-value problems (Q1321258) (← links)
- Local minima of the trust region problem (Q1321448) (← links)
- On the solution of a two ball trust region subproblem (Q1332308) (← links)
- On piecewise quadratic Newton and trust region problems (Q1356055) (← links)
- A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems (Q1356057) (← links)
- Convergence to a second-order point of a trust-region algorithm with a nonmonotonic penalty parameter for constrained optimization (Q1359463) (← links)
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres (Q1362986) (← links)
- Trust region affine scaling algorithms for linearly constrained convex and concave programs (Q1380941) (← links)
- Solving large-scale constrained least-squares problems. (Q1406109) (← links)
- A new affine scaling interior point algorithm for nonlinear optimization subject to linear equality and inequality constraints. (Q1412814) (← links)