The following pages link to Computing a Trust Region Step (Q3343340):
Displaying 50 items.
- 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)
- Robustness of trajectories with finite time extent (Q1614418) (← links)
- Numerical analysis of bump solutions for neural field equations with periodic microstructure (Q1643078) (← links)
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices (Q1646573) (← links)
- A globally convergent method for nonlinear least-squares problems based on the Gauss-Newton model with spectral correction (Q1653953) (← links)
- Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation (Q1654384) (← links)
- An efficient algorithm for solving the generalized trust region subproblem (Q1655384) (← links)
- New zero-finders for trust-region computations (Q1678583) (← links)
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints (Q1679484) (← links)
- A linear-time algorithm for the trust region subproblem based on hidden convexity (Q1686552) (← links)
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint (Q1717222) (← links)
- A note on robust descent in differentiable optimization (Q1728324) (← links)
- On an elliptical trust-region procedure for ill-posed nonlinear least-squares problems (Q1730826) (← links)
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (Q1754299) (← links)
- Generalized indirect inference for discrete choice models (Q1754519) (← links)
- Optimal error correction and methods of feasible directions (Q1762400) (← links)
- A Jacobian smoothing method for box constrained variational inequality problems (Q1765876) (← links)
- A geometric analysis of phase retrieval (Q1785008) (← links)
- Distributed Gauss-Newton optimization method for history matching problems with multiple best matches (Q1785159) (← links)
- A new regularized quasi-Newton method for unconstrained optimization (Q1800450) (← links)
- An efficient trust region method for unconstrained discrete-time optimal control problems (Q1804374) (← links)
- Optimization of dual response systems: A comprehensive procedure for degenerate and nondegenerate problems (Q1806895) (← links)
- Nonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization (Q1811590) (← links)
- An affine scaling trust-region approach to bound-constrained nonlinear systems (Q1861959) (← links)
- Global Newton-type methods and semismooth reformulations for NCP (Q1861964) (← links)
- An interior method for nonconvex semidefinite programs (Q1863841) (← links)
- Nonmonotone trust region method for solving optimization problems (Q1886565) (← links)
- A trust-region strategy for minimization on arbitrary domains (Q1890927) (← links)
- Variational analysis of an extended eigenvalue problem (Q1893098) (← links)
- Identification of parameters in polymer crystallization (Q1899303) (← links)
- A projection technique for partitioning the nodes of a graph (Q1904714) (← links)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
- Hybrid methods for large sparse nonlinear least squares (Q1918021) (← links)
- Geometric notes on optimization with equality constraints (Q1921196) (← links)
- Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem (Q1941028) (← links)
- On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds (Q1941187) (← links)
- A trust region affine scaling method for bound constrained optimization (Q1942658) (← links)
- Mining adversarial patterns via regularized loss minimization (Q1959609) (← links)
- A reduced-space line-search method for unconstrained optimization via random descent directions (Q2007776) (← links)
- A trust region approach for numerical modeling of non-isothermal phase change (Q2009822) (← links)
- Globalized inexact proximal Newton-type methods for nonconvex composite functions (Q2028488) (← links)
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets (Q2033090) (← links)
- Subspace quadratic regularization method for group sparse multinomial logistic regression (Q2044487) (← links)
- On the optimal correction of infeasible systems of linear inequalities (Q2046550) (← links)
- An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty (Q2071422) (← links)
- On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization (Q2082285) (← links)
- Distributed quasi-Newton derivative-free optimization method for optimization problems with multiple local optima (Q2085054) (← links)
