Pages that link to "Item:Q4509759"
From MaRDI portal
The following pages link to Nonmonotone Spectral Projected Gradient Methods on Convex Sets (Q4509759):
Displaying 50 items.
- A Fast Algorithm for Maximum Likelihood Estimation of Mixture Proportions Using Sequential Quadratic Programming (Q89288) (← links)
- Nomonotone spectral gradient method for sparse recovery (Q256063) (← links)
- On the application of the spectral projected gradient method in image segmentation (Q268708) (← links)
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
- Packing ellipsoids by nonlinear optimization (Q312475) (← links)
- An active set truncated Newton method for large-scale bound constrained optimization (Q316586) (← links)
- A biased random-key genetic algorithm for the unequal area facility layout problem (Q319725) (← links)
- Local analysis of a spectral correction for the Gauss-Newton model applied to quadratic residual problems (Q329315) (← links)
- Computationally efficient approach for the minimization of volume constrained vector-valued Ginzburg-Landau energy functional (Q350070) (← links)
- Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization (Q354621) (← links)
- Scaling on the spectral gradient method (Q368739) (← links)
- Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization (Q370023) (← links)
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals (Q372857) (← links)
- On the optimal design of river fishways (Q400086) (← links)
- Model-based multiple rigid object detection and registration in unstructured range data (Q408868) (← links)
- Inexact restoration method for minimization problems arising in electronic structure calculations (Q409270) (← links)
- A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization (Q421813) (← links)
- Non-monotone projection gradient method for non-negative matrix factorization (Q429483) (← links)
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand (Q429526) (← links)
- Implementation of an optimal first-order method for strongly convex total variation regularization (Q438730) (← links)
- Robust least square semidefinite programming with applications (Q457207) (← links)
- A new analysis on the Barzilai-Borwein gradient method (Q457542) (← links)
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming (Q463732) (← links)
- Guaranteed clustering and biclustering via semidefinite programming (Q463740) (← links)
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function (Q467409) (← links)
- Conditional nonlinear optimal perturbation of a coupled Lorenz model (Q474682) (← links)
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing (Q474971) (← links)
- Stackelberg strategies for wastewater management (Q484869) (← links)
- A Barzilai-Borwein type method for minimizing composite functions (Q494671) (← links)
- A class of diagonal quasi-Newton methods for large-scale convex minimization (Q503542) (← links)
- A quasi-Newton algorithm for large-scale nonlinear equations (Q509967) (← links)
- Computing the generalized eigenvalues of weakly symmetric tensors (Q513717) (← links)
- Algorithm for inequality-constrained least squares problems (Q520270) (← links)
- An iteratively approximated gradient projection algorithm for sparse signal reconstruction (Q529940) (← links)
- Convex constrained optimization for large-scale generalized Sylvester equations (Q535294) (← links)
- Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing (Q540241) (← links)
- Large correlation analysis (Q547968) (← links)
- Convergence properties of nonmonotone spectral projected gradient methods (Q557737) (← links)
- Duality-based algorithms for total-variation-regularized image restoration (Q616786) (← links)
- A multivariate spectral projected gradient method for bound constrained optimization (Q629482) (← links)
- A projected-gradient interior-point algorithm for complementarity problems (Q634730) (← 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)
- On the natural merit function for solving complementarity problems (Q647391) (← links)
- A new generalized shrinkage conjugate gradient method for sparse recovery (Q667880) (← links)
- Spectral projected gradient method for stochastic optimization (Q670658) (← links)
- A Kronecker approximation with a convex constrained optimization method for blind image restoration (Q694158) (← links)
- Continuous GRASP with a local active-set method for bound-constrained global optimization (Q708907) (← links)
- An augmented Lagrangian approach for sparse principal component analysis (Q715084) (← links)
