On the Goldstein-Levitin-Polyak gradient projection method
From MaRDI portal
Publication:4090967
Cited in
(only showing first 100 items - show all)- A class of projected-search methods for bound-constrained optimization
- Cost minimization of a multiple section power cable supplying several remote telecom equipment
- Newton projection method as applied to assembly simulation
- An improved hyperplane projection method for generalized Nash equilibrium problems with extrapolation technique
- Convergence rate analysis for fixed-point iterations of generalized averaged nonexpansive operators
- On the inexact scaled gradient projection method
- Shape optimization for tumor location
- Synchronisation and control of proliferation in cycling cell population models with age structure
- Learning with tensors: a framework based on convex optimization and spectral regularization
- On finite convergence and constraint identification of subgradient projection methods
- Choose your path wisely: gradient descent in a Bregman distance framework
- A class of superlinearly convergent projection algorithms with relaxed stepsizes
- On the convergence of projected gradient processes to singular critical points
- Reconstruction of Voronoi diagrams in inverse potential problems
- Projected gradient methods for linearly constrained problems
- Bounded perturbation resilience of projected scaled gradient methods
- Ergodic convergence in subgradient optimization
- Computational aspects of two-segment separable programming
- Novel algorithm for non-negative matrix factorization
- A feasible direction algorithm for convex optimization: Global convergence rates
- Non-expected route choice model under risk on stochastic traffic networks
- A novel projected gradient-like method for optimization problems with simple constraints
- Computational study of state-of-the-art path-based traffic assignment algorithms
- Algorithms for a class of nondifferentiable problems
- A least-distance programming procedure for minimization problems under linear constraints
- The conditional maximum likelihood estimation for the Cox–Aalen model with doubly truncated data
- Optimal selection of the regularization function in a weighted total variation model. II: Algorithm, its analysis and numerical tests
- Optimization of a Multiphysics Problem in Semiconductor Laser Design
- Family of projected descent methods for optimization problems with simple bounds
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Inexact gradient projection method with relative error tolerance
- Sample size selection in optimization methods for machine learning
- On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches
- Online learning of a weighted selective naive Bayes classifier with non-convex optimization
- Numerical approach to monotone variational inequalities by a one-step projected reflected gradient method with line-search procedure
- Convergence of the exponentiated gradient method with Armijo line search
- The effect of perturbations on the convergence rates of optimization algorithms
- Adaptive Relevance Matrices in Learning Vector Quantization
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
- Variational exposure fusion with optimal local contrast
- Convergence of one-step projected gradient methods for variational inequalities
- Computing the generalized eigenvalues of weakly symmetric tensors
- Convergence of the Implicit Filtering Method for Constrained Optimization of Noisy Functions
- The active-set method for nonnegative regularization of linear ill-posed problems
- An active-set method for second-order conic-constrained quadratic programming
- On image reconstruction algorithms for binary electromagnetic geotomography
- Coupling the auxiliary problem principle with descent methods of pseudoconvex programming
- Computation of the NPMLE of distribution functions for interval censored and truncated data with applications to the Cox model.
- Cooperative adaptive sampling of random fields with partially known covariance
- Active-set identification with complexity guarantees of an almost cyclic 2-coordinate descent method with Armijo line search
- Global convergence of a modified gradient projection method for convex constrained problems
- Iterative learning control for constrained linear systems
- Single stage prediction with embedded topic modeling of online reviews for mobile app management
- Lasso estimation of hierarchical interactions for analyzing heterogeneity of treatment effect
- Convex constrained optimization for large-scale generalized Sylvester equations
- An implementable proximal point algorithmic framework for nuclear norm minimization
- An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality problems
- Computation and application of the paired combinatorial logit stochastic user equilibrium problem
- Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities
- Optimal Control of the Landau–de Gennes Model of Nematic Liquid Crystals
- A projected Newton method for minimization problems with nonlinear inequality constraints
- A unified description of iterative algorithms for traffic equilibria
- Efficient projected gradient methods for cardinality constrained optimization
- Face recognition from caption-based supervision
- On iterative algorithms for linear least squares problems with bound constraints
- A comparison of numerical methods for solving multibody dynamics problems with frictional contact modeled via differential variational inequalities
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- An active set algorithm for nonlinear optimization with polyhedral constraints
- A cyclic projected gradient method
- Strong convergence of projected reflected gradient methods for variational inequalities
- Pareto-optimal sustainable transportation network design under spatial queuing
- Restricted simplicial decomposition for convex constrained problems
- Convex quadratic programming with one constraint and bounded variables
- On the rate of convergence of projected Barzilai-Borwein methods
- Machine learning based iterative learning control for non‐repetitive time‐varying systems
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Using Nesterov's method to accelerate multibody dynamics with friction and contact
- Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model
- Non-monotone projection gradient method for non-negative matrix factorization
- Projected gradient method for kernel discriminant nonnegative matrix factorization and the applications
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints
- Applying the gradient projection method to a model of proportional membership for fuzzy cluster analysis
- A PDE-constrained optimization approach for topology optimization of strained photonic devices
- scientific article; zbMATH DE number 1286268 (Why is no real title available?)
- Prior Learning and Convex-Concave Regularization of Binary Tomography
- Quasi non-negative quaternion matrix factorization with application to color face recognition
- Optimal Coatings, Bang‐Bang Controls, And Gradient Techniques
- A gradient descent method for estimating the Markov chain choice model
- Data-driven distributionally robust risk parity portfolio optimization
- Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
- A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem
- Solving the combined modal split and traffic assignment problem with two types of transit impedance function
- Convex optimization techniques in compliant assembly simulation
- A Kronecker approximation with a convex constrained optimization method for blind image restoration
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
- On the gradient-projection method for solving the nonsymmetric linear complementarity problem
- A comparison of numerical methods for optimal shape design problems
- Algorithms for bound constrained quadratic programming problems
- Efficient reliable image reconstruction schemes for diffuse optical tomography
- On the interplay between acceleration and identification for the proximal gradient algorithm
This page was built for publication: On the Goldstein-Levitin-Polyak gradient projection method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4090967)