SPG

swMATH897MaRDI QIDQ13641FDOQ13641

Author name not available (Why is that?)

Described by source

• Algorithm 813

Cited In (79)

• Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
• A computation study on an integrated alternating direction method of multipliers for large scale optimization
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• Variable fixing method by weighted average for the continuous quadratic knapsack problem
• Convex constrained optimization for large-scale generalized Sylvester equations
• Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
• Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
• Hybrid spectral gradient method for the unconstrained minimization problem
• On the application of the spectral projected gradient method in image segmentation
• Large correlation analysis
• Quasi-Newton acceleration for equality-constrained minimization
• Continuous GRASP with a local active-set method for bound-constrained global optimization
• A Spectral Projected Gradient Optimization for Binary Tomography
• An Ellipsoidal Branch and Bound Algorithm for Global Optimization
• On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
• Method of sentinels for packing items within arbitrary convex regions
• An active set limited memory BFGS algorithm for bound constrained optimization
• A Benchmark Evaluation of Large-Scale Optimization Approaches to Binary Tomography
• Complexity and performance of an Augmented Lagrangian algorithm
• On Regularization and Active-set Methods with Complexity for Constrained Optimization
• A convex optimization approach for solving large scale linear systems
• A Kronecker approximation with a convex constrained optimization method for blind image restoration
• A spectral updating for the method of moving asymptotes
• Recent Advances in Bound Constrained Optimization
• Minimization subproblems and heuristics for an applied clustering problem
• Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate.
• Residual algorithm for large-scale positive definite generalized eigenvalue problems
• Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
• Spectral projected gradient and variable metric methods for optimization with linear inequalities
• Spectral projected subgradient with a momentum term for the Lagrangean dual approach
• Packing ellipsoids by nonlinear optimization
• Gradient methods with adaptive step-sizes
• Inexact variable metric method for convex-constrained optimization problems
• Constrained optimization with integer and continuous variables using inexact restoration and projected gradients
• Modified spectral projected subgradient method: convergence analysis and momentum parameter heuristics
• Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
• Inexact spectral projected gradient methods on convex sets
• Computing a Nearest Correlation Matrix with Factor Structure
• Adjoint-free calculation method for conditional nonlinear optimal perturbations
• Title not available (Why is that?)
• Second-order negative-curvature methods for box-constrained and general constrained optimization
• A Newton's method for the continuous quadratic knapsack problem
• Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
• Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
• Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
• Title not available (Why is that?)
• On the natural merit function for solving complementarity problems
• A new line search inexact restoration approach for nonlinear programming
• Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
• Convergence analysis for the modified spectral projected subgradient method
• Modified active set projected spectral gradient method for bound constrained optimization
• Block relaxation and majorization methods for the nearest correlation matrix with factor structure
• Nonmonotone projected gradient methods based on barrier and Euclidean distances
• LMBOPT: a limited memory method for bound-constrained optimization
• Large-scale active-set box-constrained optimization method with spectral projected gradients
• Spectral Projected Gradient Method with Inexact Restoration for Minimization with Nonconvex Constraints
• Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
• An algorithm for the fast solution of symmetric linear complementarity problems
• Inexact restoration method for minimization problems arising in electronic structure calculations
• Evaluating bound-constrained minimization software
• A flexible inexact-restoration method for constrained optimization
• Monotone projected gradient methods for large-scale box-constrained quadratic programming
• Minimizing the object dimensions in circle and sphere packing problems
• Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
• A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem
• An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
• An efficient approach based on the gradient definition for solving conditional nonlinear optimal perturbation
• Inexact primal–dual gradient projection methods for nonlinear optimization on convex set
• The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints
• A nonlinear programming model with implicit variables for packing ellipsoids
• Secant Acceleration of Sequential Residual Methods for Solving Large-Scale Nonlinear Systems of Equations
• On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
• Title not available (Why is that?)
• An extended delayed weighted gradient algorithm for solving strongly convex optimization problems
• Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems
• Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem
• Positive Definite Matrices: Data Representation and Applications to Computer Vision
• Regularized graph cuts based discrete tomography reconstruction methods
• Inexact restoration for derivative-free expensive function minimization and applications

This page was built for software: SPG