Bounded lower subdifferentiability optimization techniques: applications
From MaRDI portal
Recommendations
- Extensions of subgradient calculus with applications to optimization
- Subdifferentials and derivatives with respect to a set and applications to optimization
- Fractional programming by lower subdifferentiability techniques
- Semiregularity and Generalized Subdifferentials with Applications to Optimization
- scientific article; zbMATH DE number 123904
- Continuous subdifferential approximations and their applications
- New results in subdifferential calculus with applications to convex optimization
- Subgradient method for minimization of convex functionals and some efficiency bounds
- Subgradient and bundle methods for nonsmooth optimization
- scientific article; zbMATH DE number 3935849
Cites work
- scientific article; zbMATH DE number 2068028 (Why is no real title available?)
- scientific article; zbMATH DE number 872150 (Why is no real title available?)
- scientific article; zbMATH DE number 2196500 (Why is no real title available?)
- A review of applications of the cutting angle methods
- Abstract convexity and global optimization
- Cutting angle method – a tool for constrained global optimization
- Extended cutting angle method of global optimization
- Fast algorithm for the cutting angle method of global optimization
- Fractional programming by lower subdifferentiability techniques
- Geometry and combinatorics of the cutting angle method
- Handbook of global optimization
- Lower subdifferentiable functions and their minimization by cutting planes
- Method of centers for generalized fractional programming
- Modified versions of the cutting angle method.
- Newton's method for convex programming and Tschebyscheff approximation
- On Nonlinear Fractional Programming
- Quasiconvex optimization and location theory
- The Cutting-Plane Method for Solving Convex Programs
- The generalized maximal covering location problem
Cited in
(4)- Comparative study of RPSALG algorithm for convex semi-infinite programming
- Lower subdifferentiable functions and their minimization by cutting planes
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
- Dual and bidual problems for a Lipschitz optimization problem based on quasi-conjugation
This page was built for publication: Bounded lower subdifferentiability optimization techniques: applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975769)
