Pages that link to "Item:Q4460568"

The following pages link to Inexact spectral projected gradient methods on convex sets (Q4460568):

Displaying 50 items.

• Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem (Q343664) (← links)
• Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization (Q370023) (← links)
• Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds (Q408215) (← links)
• Inexact restoration method for minimization problems arising in electronic structure calculations (Q409270) (← links)
• A Barzilai-Borwein type method for minimizing composite functions (Q494671) (← links)
• Convex constrained optimization for large-scale generalized Sylvester equations (Q535294) (← links)
• Convergence properties of nonmonotone spectral projected gradient methods (Q557737) (← links)
• A multivariate spectral projected gradient method for bound constrained optimization (Q629482) (← links)
• A projected-gradient interior-point algorithm for complementarity problems (Q634730) (← links)
• On the natural merit function for solving complementarity problems (Q647391) (← links)
• A new generalized shrinkage conjugate gradient method for sparse recovery (Q667880) (← links)
• A Kronecker approximation with a convex constrained optimization method for blind image restoration (Q694158) (← links)
• Impulse noise removal by an adaptive trust-region method (Q780152) (← links)
• Accelerating gradient projection methods for \(\ell _1\)-constrained signal recovery by steplength selection rules (Q837553) (← 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)
• Density-based globally convergent trust-region methods for self-consistent field electronic structure calculations (Q882583) (← links)
• A new steplength selection for scaled gradient methods with application to image deblurring (Q897119) (← links)
• Application of the restrained optimal perturbation method to study the backward heat conduction problem (Q905354) (← links)
• A derivative-free nonmonotone line-search technique for unconstrained optimization (Q935796) (← links)
• Solving bound constrained optimization via a new nonmonotone spectral projected gradient method (Q941611) (← links)
• A new line search inexact restoration approach for nonlinear programming (Q975358) (← links)
• Quasi-Newton acceleration for equality-constrained minimization (Q1001193) (← links)
• Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization (Q1021258) (← links)
• Constrained optimization with integer and continuous variables using inexact restoration and projected gradients (Q1653960) (← links)
• Efficient projected gradient methods for cardinality constrained optimization (Q1729947) (← links)
• A cyclic block coordinate descent method with generalized gradient projections (Q1733536) (← links)
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming (Q1770257) (← links)
• Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm (Q1790679) (← links)
• Fast projections onto mixed-norm balls with applications (Q1944995) (← links)
• A cyclic projected gradient method (Q1946620) (← links)
• Steplength selection in gradient projection methods for box-constrained quadratic programs (Q2009551) (← links)
• Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems (Q2010107) (← links)
• On large-scale unconstrained optimization and arbitrary regularization (Q2070329) (← links)
• On the inexact scaled gradient projection method (Q2070333) (← links)
• A matrix-free trust-region Newton algorithm for convex-constrained optimization (Q2119752) (← links)
• Inexact restoration for derivative-free expensive function minimization and applications (Q2122038) (← links)
• LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
• Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints (Q2203094) (← links)
• Optimal non-negative forecast reconciliation (Q2209697) (← links)
• Exact spectral-like gradient method for distributed optimization (Q2282815) (← links)
• On efficiency of nonmonotone Armijo-type line searches (Q2284837) (← links)
• A family of spectral gradient methods for optimization (Q2322552) (← links)
• Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems (Q2329657) (← links)
• A flexible inexact-restoration method for constrained optimization (Q2346395) (← links)
• Global sensitivity analysis based on high-dimensional sparse surrogate construction (Q2363869) (← links)
• Second-order negative-curvature methods for box-constrained and general constrained optimization (Q2379692) (← links)
• Augmented Lagrangian methods under the constant positive linear dependence constraint qualification (Q2467167) (← links)
• Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization (Q2479826) (← links)