Algorithms for quasiconvex minimization
From MaRDI portal
Publication:3112506
DOI10.1080/02331934.2010.528760zbMath1233.90269MaRDI QIDQ3112506
Marcos Vinicio Travaglia, João Xavier da Cruz Neto, Jurandir O. Lopes
Publication date: 10 January 2012
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2010.528760
90C35: Programming involving graphs or networks
Related Items
The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions, Existence and uniqueness of maximal elements for preference relations: variational approach, Approximation of quasiconvex functions by neatly quasiconvex functions, A subgradient method for equilibrium problems involving quasiconvex bifunctions
Cites Work
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- Lower subdifferentiable functions and their minimization by cutting planes
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- Convergence of some algorithms for convex minimization
- Characterization of solution sets of quasiconvex programs
- Convergence of implementable descent algorithms for unconstrained optimization
- Minimization of functions having Lipschitz continuous first partial derivatives
- A note on the gradient method
- Convergence of the steepest descent method for minimizing quasiconvex functions
- Algorithms for the quasiconvex feasibility problem
- Lower subdifferentiability in minimax fractional programming*
- Full convergence of the steepest descent method with inexact line searches
- Extension of subgradient techniques for nonsmooth optimization in Banach spaces
