The following pages link to GQTPAR (Q19481):
Displayed 50 items.
- 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)
- A retrospective trust-region method for unconstrained optimization (Q964178) (← links)
- A new smoothing Newton-type algorithm for semi-infinite programming (Q969747) (← links)
- On solving trust-region and other regularised subproblems in optimization (Q977328) (← links)
- Solving regularized total least squares problems based on eigenproblems (Q987876) (← links)
- An affine scaling optimal path method with interior backtracking curvilinear technique for linear constrained optimization (Q1004230) (← links)
- Distance-based discriminant analysis method and its applications (Q1008946) (← links)
- Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities (Q1012237) (← links)
- On Lagrange multipliers of trust-region subproblems (Q1014888) (← links)
- New optimality conditions for quadratic optimization problems with binary constraints (Q1024733) (← links)
- BFGS trust-region method for symmetric nonlinear equations (Q1026429) (← links)
- A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational results (Q1026441) (← links)
- Nonmonotonic reduced projected Hessian method via an affine scaling interior modified gradient path for bounded-constrained optimization (Q1031969) (← links)
- Newton-Krylov type algorithm for solving nonlinear least squares problems (Q1035156) (← links)
- Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming (Q1035905) (← links)
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← 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)
- Backward error bounds for constrained least squares problems (Q1293243) (← links)
- Advances in trust region algorithms for constrained optimization (Q1294548) (← links)
- A QP-free constrained Newton-type method for variational inequality problems (Q1295959) (← 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)
- 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)
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres (Q1362986) (← links)
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms (Q1368737) (← links)