The following pages link to TRON (Q16882):
Displaying 50 items.
- A limited memory quasi-Newton trust-region method for box constrained optimization (Q269370) (← links)
- An active set truncated Newton method for large-scale bound constrained optimization (Q316586) (← links)
- An active set algorithm for nonlinear optimization with polyhedral constraints (Q341314) (← links)
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization (Q396257) (← links)
- A framework for the upscaling of the electrical conductivity in the quasi-static Maxwell's equations (Q508013) (← links)
- An accurate active set Newton algorithm for large scale bound constrained optimization. (Q548593) (← links)
- An alternating projected gradient algorithm for nonnegative matrix factorization (Q555416) (← links)
- Modified active set projected spectral gradient method for bound constrained optimization (Q638841) (← links)
- An active set limited memory BFGS algorithm for bound constrained optimization (Q638888) (← links)
- Image processing using Newton-based algorithm of nonnegative matrix factorization (Q668756) (← links)
- Numerical methods for \(A\)-optimal designs with a sparsity constraint for ill-posed inverse problems (Q694600) (← links)
- Sample size selection in optimization methods for machine learning (Q715253) (← links)
- A convergent decomposition method for box-constrained optimization problems (Q839804) (← links)
- Least squares problems with inequality constraints as quadratic constraints (Q848575) (← links)
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints (Q853889) (← links)
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q870176) (← links)
- A new nonmonotone adaptive retrospective trust region method for unconstrained optimization problems (Q896192) (← links)
- An active-set projected trust region algorithm for box constrained optimization problems (Q905153) (← links)
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization (Q929334) (← links)
- On solving \(L_{q}\)-penalized regressions (Q933880) (← links)
- Conjugate gradient algorithms in nonconvex optimization (Q947710) (← links)
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q955062) (← links)
- Sensitivity analysis of the strain criterion for multidimensional scaling (Q959142) (← links)
- Alternative gradient algorithms with applications to nonnegative matrix factorizations (Q979255) (← links)
- An active set quasi-Newton method with projected search for bound constrained minimization (Q980100) (← links)
- Mesh shape-quality optimization using the inverse mean-ratio metric (Q985312) (← links)
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints (Q985699) (← links)
- An algorithm for the fast solution of symmetric linear complementarity problems (Q998634) (← links)
- A sparse counterpart of Reichel and Gragg's package QRUP (Q1044853) (← links)
- Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function (Q1411634) (← links)
- A survey of truncated-Newton methods (Q1593812) (← links)
- New projection-type methods for monotone LCP with finite termination (Q1614999) (← links)
- Local convergence analysis of projection-type algorithms: unified approach (Q1810933) (← links)
- Large-scale active-set box-constrained optimization method with spectral projected gradients (Q1812088) (← links)
- Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation (Q1827220) (← links)
- A limited-memory multipoint symmetric secant method for bound constrained optimization (Q1861917) (← links)
- An affine scaling trust-region approach to bound-constrained nonlinear systems (Q1861959) (← links)
- Some recent advances in projection-type methods for variational inequalities (Q1872978) (← links)
- A trust region SQP algorithm for equality constrained parameter estimation with simple parameter bounds (Q1876585) (← links)
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems (Q1890303) (← links)
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization (Q1935275) (← links)
- A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory (Q1937080) (← links)
- Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization (Q2028460) (← links)
- A reduced proximal-point homotopy method for large-scale non-convex BQP (Q2114822) (← links)
- A matrix-free trust-region Newton algorithm for convex-constrained optimization (Q2119752) (← links)
- A primal-dual algorithm for risk minimization (Q2133418) (← links)
- Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm (Q2176186) (← links)
- Scaled projected-directions methods with application to transmission tomography (Q2218907) (← links)
- Non-negative moment fitting quadrature rules for fictitious domain methods (Q2234890) (← links)
- Globally convergent DC trust-region methods (Q2250078) (← links)
