Pages that link to "Item:Q2277145"
From MaRDI portal
The following pages link to Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms (Q2277145):
Displaying 27 items.
- A model-hybrid approach for unconstrained optimization problems (Q403087) (← links)
- A global optimization algorithm for sum of quadratic ratios problem with coefficients (Q440994) (← links)
- A nonmonotone adaptive trust region method for unconstrained optimization based on conic model (Q618131) (← links)
- A trust region method with a conic model for nonlinearly constrained optimization (Q854560) (← links)
- A fractional programming algorithm based on conic quasi-Newton trust region method for unconstrained minimization (Q856089) (← links)
- A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy (Q864760) (← links)
- A nonmonotone trust-region method of conic model for unconstrained optimization (Q939515) (← links)
- A nonmonotone conic trust region method based on line search for solving unconstrained optimization (Q1002190) (← links)
- A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational results (Q1026441) (← links)
- On the updating scheme in a class of collinear scaling algorithms for sparse minimization (Q1321251) (← links)
- On Davidon's collinear scaling algorithms for optimization (Q1332350) (← links)
- Interpolation by conic model for unconstrained optimization (Q1343680) (← links)
- Some convergence properties of descent methods (Q1372548) (← links)
- Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem (Q1686558) (← links)
- Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization (Q2258098) (← links)
- A subspace minimization conjugate gradient method based on conic model for unconstrained optimization (Q2322338) (← links)
- A class of collinear scaling algorithms for bound-constrained optimization: convergence theorems (Q2371881) (← links)
- A quasi-Newton trust region method with a new conic model for the unconstrained optimization (Q2378932) (← links)
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints (Q2383678) (← links)
- A variant of trust-region methods for unconstrained optimization (Q2518723) (← links)
- A new nonmonotone trust-region method of conic model for solving unconstrained optimization (Q2654183) (← links)
- An improved hybrid quantum optimization algorithm for solving nonlinear equations (Q2690284) (← links)
- An adaptive conic trust-region method for unconstrained optimization (Q3369518) (← links)
- A trust-region method with a conic model for unconstrained optimization (Q3528018) (← links)
- (Q4312264) (← links)
- Local and<i>Q</i>-superlinear convergence of a class of collinear scaling algorithms that extends quasi-newton methods with broyden's bounded-⊘ class of updates† ‡ (Q4327895) (← links)
- A numerical evaluation of some collinear scaling algorithms for unconstrained (Q4836767) (← links)