Two-Point Step Size Gradient Methods
From MaRDI portal
Publication:3779680
Recommendations
Cited in
(only showing first 100 items - show all)- Stable equilibrium configuration of two bar truss by an efficient nonmonotone global Barzilai-Borwein gradient method in a fuzzy environment
- Projected gradient methods for synchrotron radiation spectra distribution function reconstruction
- Separating variables to accelerate non-convex regularized optimization
- A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
- On quasi-Newton methods in fast Fourier transform-based micromechanics
- A class of modified BFGS methods with function value information for unconstrained optimization
- An adjoint method in inverse problems of chromatography
- Inertial projected gradient method for large-scale topology optimization
- Inexact alternating direction methods of multipliers for separable convex optimization
- A modified spectral conjugate gradient method with global convergence
- Nomonotone spectral gradient method for sparse recovery
- A novel approach for solving semidefinite programs
- Gradient methods exploiting spectral properties
- A dual spectral projected gradient method for log-determinant semidefinite problems
- An effective first order reliability method based on Barzilai-Borwein step
- An efficient solution scheme for small-strain crystal-elasto-viscoplasticity in a dual framework
- A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems
- A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations
- Fused Lasso approach in portfolio selection
- An acceleration of proximal diagonal Newton method
- Alternating cyclic vector extrapolation technique for accelerating nonlinear optimization algorithms and fixed-point mapping applications
- On the stationarity for nonlinear optimization problems with polyhedral constraints
- Sensitivity analysis and tailored design of minimization diagrams
- Essentials of numerical nonsmooth optimization
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- A scaled nonlinear conjugate gradient algorithm for unconstrained optimization
- A structured L-BFGS method and its application to inverse problems
- Discrete processes and their continuous limits
- On efficiency of nonmonotone Armijo-type line searches
- Compositional inverse Gaussian models with applications in compositional data analysis with possible zero observations
- Exactly Uncorrelated Sparse Principal Component Analysis
- Computing the effective response of heterogeneous materials with thermomechanically coupled constituents by an implicit fast Fourier transform-based approach
- On non-stationary polarization methods in FFT-based computational micromechanics
- Lippmann-Schwinger solvers for the computational homogenization of materials with pores
- On the Barzilai-Borwein basic scheme in FFT-based computational homogenization
- Turing instability analysis and parameter identification based on optimal control and statistics method for a rumor propagation system
- Price competition with differentiated products on a two-dimensional plane: the impact of partial cartel on firms' profits and behavior
- Solving nonlinear equations with the convex combination of two positive spectral coefficients
- Convergence of inexact forward-backward algorithms using the forward-backward envelope
- A proximal neurodynamic model for a system of non-linear inverse mixed variational inequalities
- An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems
- Spatio-temporal random fields: compressible representation and distributed estimation
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS
- Riemannian Optimization on the Symplectic Stiefel Manifold
- Application of scaled nonlinear conjugate-gradient algorithms to the inverse natural convection problem
- A computation study on an integrated alternating direction method of multipliers for large scale optimization
- An adaptive scaled BFGS method for unconstrained optimization
- A variational approach to Gibbs artifacts removal in MRI
- Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing
- A new method with sufficient descent property for unconstrained optimization
- A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- A tensor optimization algorithm for computing Lagrangians of hypergraphs
- Lasso estimation of hierarchical interactions for analyzing heterogeneity of treatment effect
- Performance of acceleration techniques for staggered phase-field solutions
- Convex constrained optimization for large-scale generalized Sylvester equations
- Modified nonmonotone Armijo line search for descent method
- Numerical methods for high-dimensional kinetic equations
- A practical method for solving large-scale TRS
- Nonlinear orthomin(k) methods
- Acceleration of the EM algorithm via extrapolation methods: review, comparison and new methods
- A comparison of edge-preserving approaches for differential interference contrast microscopy
- The modified accelerated Bregman method for regularized basis pursuit problem
- Modified optimal Perry conjugate gradient method for solving system of monotone equations with applications
- Structured spectral algorithm with a nonmonotone line search for nonlinear least squares
- Approximate norm descent methods for constrained nonlinear systems
- A nonmonotone spectral projected gradient method for tensor eigenvalue complementarity problems
- Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size
- A class of accelerated subspace minimization conjugate gradient methods
- A diagonally scaled Newton-type proximal method for minimization of the models with nonsmooth composite cost functions
- Projected nonmonotone search methods for optimization with orthogonality constraints
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- A software framework for embedded nonlinear model predictive control using a gradient-based augmented Lagrangian approach (GRAMPC)
- An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem
- A hybrid BB-type method for solving large scale unconstrained optimization
- Nonmonotone adaptive trust region method with line search based on new diagonal updating
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
- Transition pathways in cylinder-gyroid interface
- Learning an adaptive dictionary using a projected gradient method and its application on image de-noising
- Low cost optimization techniques for solving the nonlinear seismic reflection tomography problem
- A parallel line search subspace correction method for composite convex optimization
- Greatest descent algorithms in unconstrained optimization
- A maxentropic procedure for reconstructing a distribution from its marginals
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
- A spectral algorithm for large-scale systems of nonlinear monotone equations
- Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization
- A family of Hager-Zhang conjugate gradient methods for system of monotone nonlinear equations
- Efficient projected gradient methods for cardinality constrained optimization
- Prediction-correction method with BB step sizes
- A note on a multiplicative parameters gradient method
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Extension of the Barzilai–Borwein Method for Quadratic Forms in Finite Euclidean Spaces
- An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization
- A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization
- A new generalized shrinkage conjugate gradient method for sparse recovery
- Proximal gradient methods beyond monotony
- Impulse noise removal by a nonmonotone adaptive gradient method
- Biorthogonal vector sequence transformations and Padé approximation of vector series
- A hybrid ODE-based method for unconstrained optimization problems
This page was built for publication: Two-Point Step Size Gradient Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3779680)
