Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces
From MaRDI portal
Publication:2141725
DOI10.1007/s10898-021-01110-2zbMath1493.90140OpenAlexW3214021126MaRDI QIDQ2141725
Yao-Hua Hu, Xiao Qi Yang, Regina Sandra Burachik
Publication date: 25 May 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01110-2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An inexact proximal method for quasiconvex minimization
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- Handbook of generalized convexity and generalized monotonicity
- Convergence rates of subgradient methods for quasi-convex optimization problems
- Limiting normal operator in quasiconvex analysis
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
- Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
- A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant
- Generalized concavity
- Generalized convexity, generalized monotonicity: recent results. Proceedings of the 5th symposium, Luminy, France, June 17--21, 1996
- Error stability properties of generalized gradient-type algorithms
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- A logarithmic-quadratic proximal method for variational inequalities
- From error bounds to the complexity of first-order descent methods for convex functions
- A unified approach to error bounds for structured convex optimization problems
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- On properties of supporting and quasi-supporting vectors
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Disciplined quasiconvex programming
- Differentiability of quasiconvex functions on separable Banach spaces
- Algorithms for the quasiconvex feasibility problem
- Interior projection-like methods for monotone variational inequalities
- Inexact subgradient methods for quasi-convex optimization problems
- A Proximal Point Method for the Variational Inequality Problem in Banach Spaces
- The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography
- Incremental Subgradient Methods for Nondifferentiable Optimization
- A proximal point algorithm with a ϕ-divergence for quasiconvex programming
- A proximal multiplier method for separable convex minimization
- On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications
- Convergence rate of a proximal multiplier algorithm for separable convex minimization
- Inexact Proximal Point Methods for Variational Inequality Problems
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence of Proximal-Like Algorithms
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- An inexact algorithm with proximal distances for variational inequalities
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- On Convergence Properties of a Subgradient Method
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- An inexact proximal decomposition method for variational inequalities with separable structure
- Abstract convergence theorem for quasi-convex optimization problems with applications
- Construction of proximal distances over symmetric cones
- Hilbert-Valued Perturbed Subgradient Algorithms
- Adjusted Sublevel Sets, Normal Operator, and Quasi-convex Programming
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
- Convex analysis and monotone operator theory in Hilbert spaces
- Convergence and efficiency of subgradient methods for quasiconvex minimization
