Pages that link to "Item:Q4090967"
From MaRDI portal
The following pages link to On the Goldstein-Levitin-Polyak gradient projection method (Q4090967):
Displaying 50 items.
- Optimal selection of the regularization function in a weighted total variation model. II: Algorithm, its analysis and numerical tests (Q1704009) (← links)
- Single stage prediction with embedded topic modeling of online reviews for mobile app management (Q1728651) (← links)
- Efficient projected gradient methods for cardinality constrained optimization (Q1729947) (← links)
- Solving the combined modal split and traffic assignment problem with two types of transit impedance function (Q1752876) (← links)
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem (Q1761957) (← links)
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming (Q1770257) (← links)
- On finite convergence and constraint identification of subgradient projection methods (Q1802955) (← links)
- On the convergence of projected gradient processes to singular critical points (Q1821692) (← links)
- A parallel descent algorithm for convex programming (Q1908925) (← links)
- A cyclic projected gradient method (Q1946620) (← links)
- Linear convergence analysis of the use of gradient projection methods on total variation problems (Q1946623) (← links)
- Dual fast projected gradient method for quadratic programming (Q1947612) (← links)
- Identification of the blood perfusion rate for laser-induced thermotherapy in the liver (Q1980982) (← links)
- Pareto-optimal sustainable transportation network design under spatial queuing (Q2005944) (← links)
- On the interplay between acceleration and identification for the proximal gradient algorithm (Q2023654) (← links)
- Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization (Q2028460) (← links)
- A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models (Q2029917) (← links)
- Realization of a framework for simulation-based large-scale shape optimization using vertex morphing (Q2032030) (← links)
- On the inexact scaled gradient projection method (Q2070333) (← links)
- A PDE-constrained optimization approach for topology optimization of strained photonic devices (Q2071416) (← links)
- On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches (Q2084591) (← links)
- A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising (Q2175442) (← links)
- A novel projected gradient-like method for optimization problems with simple constraints (Q2190861) (← links)
- Convex optimization techniques in compliant assembly simulation (Q2218917) (← links)
- Synchronisation and control of proliferation in cycling cell population models with age structure (Q2229783) (← links)
- Learning with tensors: a framework based on convex optimization and spectral regularization (Q2251466) (← links)
- A comparison of numerical methods for solving multibody dynamics problems with frictional contact modeled via differential variational inequalities (Q2309865) (← links)
- ``Active-set complexity'' of proximal gradient: how long does it take to find the sparsity pattern? (Q2311100) (← links)
- Convergence analysis for the modified spectral projected subgradient method (Q2355316) (← links)
- Restricted simplicial decomposition for convex constrained problems (Q2366609) (← links)
- The active-set method for nonnegative regularization of linear ill-posed problems (Q2369196) (← links)
- Convergence of the exponentiated gradient method with Armijo line search (Q2420800) (← links)
- Shape optimization for tumor location (Q2429052) (← links)
- Global convergence of a modified gradient projection method for convex constrained problems (Q2431943) (← links)
- Perron vector optimization applied to search engines (Q2448379) (← links)
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems (Q2515287) (← links)
- Discrete tomography by convex--concave regularization and D.C. programming (Q2573249) (← links)
- On consistency of the monotone NPMLE of survival function under the mixed case interval-censored model with left truncation (Q2667003) (← links)
- Convergence rate analysis for fixed-point iterations of generalized averaged nonexpansive operators (Q2675377) (← links)
- Inexact gradient projection method with relative error tolerance (Q2696906) (← links)
- Using Nesterov's method to accelerate multibody dynamics with friction and contact (Q2799492) (← links)
- Modulus-type inner outer iteration methods for nonnegative constrained least squares problems (Q2827061) (← links)
- Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem (Q2841142) (← links)
- Cooperative adaptive sampling of random fields with partially known covariance (Q2857081) (← links)
- Applying the Gradient Projection Method to a Model of Proportional Membership for Fuzzy Cluster Analysis (Q2957718) (← links)
- Accelerated Uzawa methods for convex optimization (Q2970101) (← links)
- Efficient reliable image reconstruction schemes for diffuse optical tomography (Q3007801) (← links)
- Iterative learning control for constrained linear systems (Q3161171) (← links)
- Variational Exposure Fusion with Optimal Local Contrast (Q3300325) (← links)
- Convergence of the Implicit Filtering Method for Constrained Optimization of Noisy Functions (Q3432717) (← links)
