Pages that link to "Item:Q1856365"
From MaRDI portal
The following pages link to Nonmonotone globalization techniques for the Barzilai-Borwein gradient method (Q1856365):
Displaying 50 items.
- An ODE-like nonmonotone method for nonsmooth convex optimization (Q330379) (← links)
- A nonmonotone trust region method with new inexact line search for unconstrained optimization (Q369443) (← links)
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand (Q429526) (← links)
- A new analysis on the Barzilai-Borwein gradient method (Q457542) (← links)
- A Barzilai-Borwein type method for minimizing composite functions (Q494671) (← links)
- Nonmonotone trust region algorithm for unconstrained optimization problems (Q618133) (← links)
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- Path loss prediction in urban environment using learning machines and dimensionality reduction techniques (Q645503) (← links)
- A nonmonotone PSB algorithm for solving unconstrained optimization (Q694601) (← links)
- An approach based on dwindling filter method for positive definite generalized eigenvalue problem (Q725751) (← links)
- A Broyden-Fletcher-Goldfarb-Shanno algorithm for reliability-based design optimization (Q823309) (← links)
- Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions (Q839683) (← links)
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization (Q849145) (← links)
- Multivariate spectral gradient method for unconstrained optimization (Q945298) (← links)
- Notes on the Dai-Yuan-Yuan modified spectral gradient method (Q984907) (← links)
- On nonmonotone Chambolle gradient projection algorithms for total variation image restoration (Q993545) (← links)
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization (Q1021258) (← links)
- A patient adaptable ECG beat classifier based on neural networks (Q1030240) (← links)
- A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems (Q1663393) (← links)
- A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization (Q1704920) (← links)
- Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization (Q1715914) (← links)
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming (Q1770257) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
- Unconstrained formulation of standard quadratic optimization problems (Q1935878) (← links)
- Nonlocal problem for a general second-order elliptic operator (Q2006027) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
- A survey of gradient methods for solving nonlinear optimization (Q2220680) (← links)
- Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization (Q2258098) (← links)
- On sparse beamformer design with reverberation (Q2295315) (← links)
- A unified convergence framework for nonmonotone inexact decomposition methods (Q2301131) (← links)
- Stable equilibrium configuration of two bar truss by an efficient nonmonotone global Barzilai-Borwein gradient method in a fuzzy environment (Q2361517) (← links)
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization (Q2374365) (← links)
- Nonmonotone derivative-free methods for nonlinear equations (Q2385543) (← links)
- An improved gradient projection-based decomposition technique for support vector machines (Q2468369) (← links)
- Memory gradient method with Goldstein line search (Q2469911) (← links)
- A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values (Q2475129) (← links)
- Nonmonotone projected gradient methods based on barrier and Euclidean distances (Q2477010) (← links)
- Convergence of nonmonotone line search method (Q2493941) (← links)
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations (Q2515062) (← links)
- On the use of iterative methods in cubic regularization for unconstrained optimization (Q2515064) (← links)
- A new family of conjugate gradient methods (Q2519734) (← links)
- Using SVM to combine global heuristics for the standard quadratic problem (Q2629704) (← links)
- Global optimization issues in deep network regression: an overview (Q2633536) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- A new nonmonotone filter Barzilai–Borwein method for solving unconstrained optimization problems (Q2804916) (← links)
- A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques (Q2829572) (← links)
- A non-monotonic method for large-scale non-negative least squares (Q2867422) (← links)
- On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization (Q2867433) (← links)
- The Barzilai and Borwein gradient method with nonmonotone line search for nonsmooth convex optimization problems (Q2884915) (← links)
- Robust Pole Assignment for Ordinary and Descriptor Systems via the Schur Form (Q2913170) (← links)