Pages that link to "Item:Q2359771"
From MaRDI portal
The following pages link to A two-stage active-set algorithm for bound-constrained optimization (Q2359771):
Displaying 12 items.
- An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
- Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient (Q2082555) (← links)
- A decomposition method for Lasso problems with zero-sum constraint (Q2106751) (← links)
- An augmented Lagrangian method exploiting an active-set strategy and second-order information (Q2139257) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
- An active set trust-region method for bound-constrained optimization (Q2169274) (← links)
- An improved bilevel optimization approach for image super-resolution based on a fractional diffusion tensor (Q2170732) (← links)
- Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm (Q2176186) (← links)
- A novel projected gradient-like method for optimization problems with simple constraints (Q2190861) (← links)
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems (Q2419552) (← links)
- An improved spatially controlled reaction-diffusion equation with a non-linear second order operator for image super-resolution (Q2665485) (← links)
