The following pages link to GQTPAR (Q19481):
Displaying 50 items.
- 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)
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited (Q2093287) (← links)
- On local nonglobal minimum of trust-region subproblem and extension (Q2093294) (← links)
- Maximizing sum of coupled traces with applications (Q2095802) (← links)
- A latent variable mixed-effects location scale model with an application to daily diary data (Q2103582) (← links)
- Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications (Q2104053) (← links)
- An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint (Q2104089) (← links)
- Low-rank approximation to entangled multipartite quantum systems (Q2107056) (← links)
- Rank-1 approximation for entangled multipartite real systems (Q2113671) (← links)
- \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm (Q2114814) (← links)
- The generalized trust region subproblem: solution complexity and convex hull results (Q2118085) (← links)
- A self-consistent-field iteration for MAXBET with an application to multi-view feature extraction (Q2124749) (← links)
- On the branch and bound algorithm for the extended trust-region subproblem (Q2141723) (← links)
- Performance enhancement of Gauss-Newton trust-region solver for distributed Gauss-Newton optimization method (Q2185999) (← links)
- On monotonic estimates of the norm of the minimizers of regularized quadratic functions in Krylov spaces (Q2192591) (← links)
- Newton-type methods for non-convex optimization under inexact Hessian information (Q2205970) (← links)
- GPS localization problem: a new model and its global optimization (Q2218874) (← links)
- Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints (Q2282813) (← links)
- On fluorophore imaging by diffusion equation model: decompositions and optimizations (Q2300551) (← links)
- Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization (Q2301133) (← links)
- Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere (Q2301183) (← links)
- Norm-constrained least-squares solutions to the matrix equation \(A X B = C\) (Q2319099) (← links)
- A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint (Q2322558) (← links)
- An efficient two-step trust-region algorithm for exactly determined consistent systems of nonlinear equations (Q2332770) (← links)
- A smoothing Levenberg-Marquardt algorithm for semi-infinite programming (Q2352422) (← links)
- A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization (Q2360814) (← links)
- A method of trust region type for minimizing noisy functions (Q2365378) (← links)
- A class of collinear scaling algorithms for bound-constrained optimization: convergence theorems (Q2371881) (← links)
- A globalized Newton method for the computation of normalized Nash equilibria (Q2392752) (← links)
- Efficient block-coordinate descent algorithms for the group Lasso (Q2392933) (← links)
- On efficiently combining limited-memory and trust-region techniques (Q2398109) (← links)
- Inexact successive quadratic approximation for regularized optimization (Q2419525) (← links)
- A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization (Q2419564) (← links)
- A modified trust region method with beale's PCG technique for optimization (Q2427396) (← links)
- A new trust region technique for the maximum weight clique problem (Q2433799) (← links)
- A generative model and a generalized trust region Newton method for noise reduction (Q2436691) (← links)
- A multiplier active-set trust-region algorithm for solving constrained optimization problem (Q2449200) (← links)
- Iterative computation of negative curvature directions in large scale optimization (Q2457949) (← links)
- A trust-region method by active-set strategy for general nonlinear optimization (Q2460581) (← links)
- On the use of simplex methods in constructing quadratic models (Q2461486) (← links)
- A new minimization protocol for solving nonlinear Poisson-Boltzmann mortar finite element equation (Q2465662) (← links)
- Survey of trust-region derivative free optimization methods (Q2469806) (← links)
