Nonmonotone Spectral Projected Gradient Methods on Convex Sets
From MaRDI portal
Recommendations
- Convergence properties of nonmonotone spectral projected gradient methods
- Inexact spectral projected gradient methods on convex sets
- A new nonmonotone spectral projected gradient method for bound constrained optimization
- Spectral projected subgradient method for nonsmooth convex optimization problems
- scientific article; zbMATH DE number 2186558
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- Solving bound constrained optimization via a new nonmonotone spectral projected gradient method
- Multivariate spectral gradient projection method for nonlinear monotone equations with convex constraints
- A Lagrangian dual spectral projected gradient method for nonconvex constrained optimization
- Inexact primal-dual gradient projection methods for nonlinear optimization on convex set
Cited in
(only showing first 100 items - show all)- Quasi-Newton acceleration for equality-constrained minimization
- An affine-scaling interior-point CBB method for box-constrained optimization
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization
- Cost minimization of a multiple section power cable supplying several remote telecom equipment
- A descent algorithm without line search for unconstrained optimization
- A new adaptive Barzilai and Borwein method for unconstrained optimization
- A deterministic optimization approach for solving the rainfall disaggregation problem
- A globally convergent method for nonlinear least-squares problems based on the Gauss-Newton model with spectral correction
- Modified spectral projected subgradient method: convergence analysis and momentum parameter heuristics
- A convex optimization approach for solving large scale linear systems
- On optimal location and management of a new industrial plant: numerical simulation and control
- Multimaterial topology optimization by volume constrained Allen-Cahn system and regularized projected steepest descent method
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization
- Smoothed _1-regularization-based line search for sparse signal recovery
- Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization
- Efficient projected gradient methods for cardinality constrained optimization
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- On the quadratic eigenvalue complementarity problem over a general convex cone
- A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem
- Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems
- On a scalable nonparametric denoising of time series signals
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- A nonmonotone gradient algorithm for total variation image denoising problems
- 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
- Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems
- An investigation of feasible descent algorithms for estimating the condition number of a matrix
- Fast projections onto mixed-norm balls with applications
- A cyclic projected gradient method
- Linear convergence analysis of the use of gradient projection methods on total variation problems
- A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties
- A dual spectral projected gradient method for log-determinant semidefinite problems
- Sparse signal inversion with impulsive noise by dual spectral projected gradient method
- The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints
- Minimizing quadratic functions with semidefinite Hessian subject to bound constraints
- A projection method for convex constrained monotone nonlinear equations with applications
- Steplength selection in gradient projection methods for box-constrained quadratic programs
- Numerical method for the generalized nonnegative tensor factorization problem
- A global Newton method for the nonsmooth vector fields on Riemannian manifolds
- On the asymptotic convergence and acceleration of gradient methods
- The gradient projection method with Armijo's step size on manifolds
- On large-scale unconstrained optimization and arbitrary regularization
- On the inexact scaled gradient projection method
- A view of computational models for image segmentation
- On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches
- Regularized graph cuts based discrete tomography reconstruction methods
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- First-order methods for the convex hull membership problem
- Hybrid limited memory gradient projection methods for box-constrained optimization problems
- Stochastic tensor complementarity problem with discrete distribution
- A matrix-free trust-region Newton algorithm for convex-constrained optimization
- Inexact restoration for derivative-free expensive function minimization and applications
- An efficient DY-type spectral conjugate gradient method for system of nonlinear monotone equations with application in signal recovery
- An extended projected residual algorithm for solving smooth convex optimization problems
- A Newton Frank-Wolfe method for constrained self-concordant minimization
- LMBOPT: a limited memory method for bound-constrained optimization
- Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming
- An application-based characterization of dynamical distance geometry problems
- A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising
- Subsampled nonmonotone spectral gradient methods
- A nonconvex truncated regularization and box-constrained model for CT reconstruction
- Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
- An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices
- One-bit tensor completion via transformed tensor singular value decomposition
- DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems
- Cone complimentary-based numerical manifold method modeling frictional and cohesive contact problems
- Globally convergent DC trust-region methods
- A new spectral method for \(l_1\)-regularized minimization
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- Exact spectral-like gradient method for distributed optimization
- On efficiency of nonmonotone Armijo-type line searches
- On sparse beamformer design with reverberation
- An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
- A unified convergence framework for nonmonotone inexact decomposition methods
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- A family of spectral gradient methods for optimization
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
- A flexible inexact-restoration method for constrained optimization
- An efficient implementation of a trust region method for box constrained optimization
- Optimality properties of an augmented Lagrangian method on infeasible problems
- Convergence analysis for the modified spectral projected subgradient method
- A secant-based Nesterov method for convex functions
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
- Second-order negative-curvature methods for box-constrained and general constrained optimization
- Optimal weed population control using nonlinear programming
- A nonlinear programming model with implicit variables for packing ellipsoids
- Runge-Kutta-like scaling techniques for first-order methods in convex optimization
- Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem
- Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization
This page was built for publication: Nonmonotone Spectral Projected Gradient Methods on Convex Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4509759)
