The following pages link to SPG (Q13641):
Displaying 50 items.
- On the application of the spectral projected gradient method in image segmentation (Q268708) (← links)
- Packing ellipsoids by nonlinear optimization (Q312475) (← links)
- Inexact restoration method for minimization problems arising in electronic structure calculations (Q409270) (← links)
- Convex constrained optimization for large-scale generalized Sylvester equations (Q535294) (← links)
- Large correlation analysis (Q547968) (← 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)
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points (Q683332) (← links)
- A computation study on an integrated alternating direction method of multipliers for large scale optimization (Q683915) (← 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)
- Block relaxation and majorization methods for the nearest correlation matrix with factor structure (Q763394) (← links)
- Hybrid spectral gradient method for the unconstrained minimization problem (Q839039) (← links)
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization (Q849145) (← links)
- Gradient methods with adaptive step-sizes (Q853675) (← links)
- Monotone projected gradient methods for large-scale box-constrained quadratic programming (Q862715) (← links)
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach (Q878598) (← links)
- Adjoint-free calculation method for conditional nonlinear optimal perturbations (Q887056) (← links)
- A Newton's method for the continuous quadratic knapsack problem (Q892383) (← links)
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm (Q925253) (← links)
- Residual algorithm for large-scale positive definite generalized eigenvalue problems (Q975355) (← links)
- A new line search inexact restoration approach for nonlinear programming (Q975358) (← links)
- An algorithm for the fast solution of symmetric linear complementarity problems (Q998634) (← links)
- Quasi-Newton acceleration for equality-constrained minimization (Q1001193) (← links)
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization (Q1021258) (← links)
- Modified spectral projected subgradient method: convergence analysis and momentum parameter heuristics (Q1653958) (← links)
- Constrained optimization with integer and continuous variables using inexact restoration and projected gradients (Q1653960) (← links)
- A convex optimization approach for solving large scale linear systems (Q1653970) (← links)
- A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem (Q1734301) (← links)
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems (Q1770091) (← links)
- Large-scale active-set box-constrained optimization method with spectral projected gradients (Q1812088) (← links)
- Minimization subproblems and heuristics for an applied clustering problem (Q1869508) (← links)
- Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate. (Q1872927) (← links)
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach (Q1887860) (← links)
- Evaluating bound-constrained minimization software (Q1928747) (← links)
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization (Q1935275) (← links)
- Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems (Q1938919) (← links)
- An efficient approach based on the gradient definition for solving conditional nonlinear optimal perturbation (Q1992596) (← links)
- The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints (Q1996996) (← links)
- Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
- Regularized graph cuts based discrete tomography reconstruction methods (Q2084613) (← links)
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
- Inexact restoration for derivative-free expensive function minimization and applications (Q2122038) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
- An extended delayed weighted gradient algorithm for solving strongly convex optimization problems (Q2161068) (← links)
- A flexible inexact-restoration method for constrained optimization (Q2346395) (← links)
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization (Q2352415) (← links)
- Convergence analysis for the modified spectral projected subgradient method (Q2355316) (← links)
- Second-order negative-curvature methods for box-constrained and general constrained optimization (Q2379692) (← links)
