Projected subgradient method for nonsmooth interval optimization problems with application
From MaRDI portal
Cites work
- A family of subgradient-based methods for convex optimization problems in a unifying framework
- A numerical solution method to interval quadratic programming
- A subgradient method based on gradient sampling for solving convex optimization problems
- Adaptive penalty-based neurodynamic approach for nonsmooth interval-valued optimization problem
- An efficient solution of nonlinear enhanced interval optimization problems and its application to portfolio optimization
- Approximate Subdifferentials and Applications. I: The Finite Dimensional Theory
- Calculus rules for global approximate minima and applications to approximate subdifferential calculus
- Duality gap in interval linear programming
- Efficient solution of interval optimization problem
- Ekeland's variational principle for interval-valued functions
- Existence of solution of constrained interval optimization problems with regularity concept
- Expansion of Generalized Hukuhara Differentiable Interval Valued Function
- Fréchet subdifferential calculus for interval-valued functions and its applications in nonsmooth interval optimization
- Generalized Hukuhara differentiability of interval-valued functions and interval differential equations
- Gradient-based descent linesearch to solve interval-valued optimization problems under gH-differentiability with application to finance
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- Karush-Kuhn-Tucker conditions for interval and fuzzy optimization in several variables under total and directional generalized differentiability
- KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions
- Multiobjective programming in optimization of the interval objective function
- New efficiency conditions for multiobjective interval-valued programming problems
- Nonlinear Programming
- Nonsmooth interval-valued optimization and saddle-point optimality criteria
- Novel solution framework for inverse problem considering interval uncertainty
- On interval-valued nonlinear programming problems
- On nondifferentiable semi-infinite multiobjective programming with interval-valued functions
- On semidifferentiable interval-valued programming problems
- On the Subdifferentiability of Convex Functions
- Optimality and duality in non-differentiable interval valued multiobjective programming
- Optimality conditions and duality in nondifferentiable interval-valued programming
- Optimality conditions and duality results for non-differentiable interval optimization problems
- Optimality conditions of type KKT for optimization problem with interval-valued objective function via generalized derivative
- Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
- Subgradient methods for saddle-point problems
- Sufficiency and duality for nonsmooth interval-valued optimization problems via generalized invex-infine functions
- The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
- Wolfe duality for interval-valued optimization
This page was built for publication: Projected subgradient method for nonsmooth interval optimization problems with application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363550)
