SPG
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Quasi-Newton acceleration for equality-constrained minimization
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- LANCELOT
- NITSOL
- LMBOPT
- CUTEr
- Modified spectral projected subgradient method: convergence analysis and momentum parameter heuristics
- Constrained optimization with integer and continuous variables using inexact restoration and projected gradients
- A convex optimization approach for solving large scale linear systems
- TRON
- TANGO
- CONV_QP
- GPDT
- CG_DESCENT
- MINQ
- FFSQP(f77)
- ALGENCAN
- A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- 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.
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Evaluating bound-constrained minimization software
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- Sparco
- Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems
- CERR
- An efficient approach based on the gradient definition for solving conditional nonlinear optimal perturbation
- The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints
- BB
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- condest
- Regularized graph cuts based discrete tomography reconstruction methods
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
- Inexact restoration for derivative-free expensive function minimization and applications
- LMBOPT: a limited memory method for bound-constrained optimization
- An extended delayed weighted gradient algorithm for solving strongly convex optimization problems
- A flexible inexact-restoration method for constrained optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Convergence analysis for the modified spectral projected subgradient method
- NAPACK
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- A nonlinear programming model with implicit variables for packing ellipsoids
- Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem
- QPLIB2014
- QL
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Minimizing the object dimensions in circle and sphere packing problems
- Nonmonotone projected gradient methods based on barrier and Euclidean distances
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Packmol
- On the application of the spectral projected gradient method in image segmentation
- LINUOA
- Positive definite matrices: data representation and applications to computer vision
- Recent advances in bound constrained optimization
- A spectral projected gradient optimization for binary tomography
- Computing a nearest correlation matrix with factor structure
- Packing ellipsoids by nonlinear optimization
- A spectral updating for the method of moving asymptotes
- Method of sentinels for packing items within arbitrary convex regions
- Discrete least squares hybrid approximation with regularization on the two-sphere
- NAPHEAP
- An Ellipsoidal Branch and Bound Algorithm for Global Optimization
- Spectral projected gradient method with inexact restoration for minimization with nonconvex constraints
- TVR-DART
- Inexact restoration method for minimization problems arising in electronic structure calculations
- Inexact spectral projected gradient methods on convex sets
- On regularization and active-set methods with complexity for constrained optimization
- Spectral projected gradient and variable metric methods for optimization with linear inequalities
- Inexact variable metric method for convex-constrained optimization problems
- Inexact primal-dual gradient projection methods for nonlinear optimization on convex set
- Convex constrained optimization for large-scale generalized Sylvester equations
- A Benchmark Evaluation of Large-Scale Optimization Approaches to Binary Tomography
- PACBB: a projected adaptive cyclic Barzilai-Borwein method for box constrained optimization
- Variational reconstruction with DC-programming
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
- Large correlation analysis
- elastoplastic contact
- Complexity and performance of an augmented Lagrangian algorithm
- Secant Acceleration of Sequential Residual Methods for Solving Large-Scale Nonlinear Systems of Equations
- MINQ8
- BenchmarkProfiles.jl
- BOX-QUACAN
- PolyStress
- Modified active set projected spectral gradient method for bound constrained optimization
- An active set limited memory BFGS algorithm for bound constrained optimization
- On the natural merit function for solving complementarity problems
- 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
- A Kronecker approximation with a convex constrained optimization method for blind image restoration
- Continuous GRASP with a local active-set method for bound-constrained global optimization
- Block relaxation and majorization methods for the nearest correlation matrix with factor structure
- Hybrid spectral gradient method for the unconstrained minimization problem
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- Gradient methods with adaptive step-sizes
- Monotone projected gradient methods for large-scale box-constrained quadratic programming
This page was built for software: SPG
