The modified subgradient algorithm based on feasible values
From MaRDI portal
Recommendations
- A primal dual modified subgradient algorithm with sharp Lagrangian
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- scientific article; zbMATH DE number 2221956
- An inexact modified subgradient algorithm for nonconvex optimization
- The performance of the modified subgradient algorithm on solving the 0-1 quadratic Knapsack problem
Cites work
- An MCDM approach to portfolio optimization.
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- Multiple criteria decision analysis. State of the art surveys
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- On augmented Lagrangians for optimization problems with a single constraint
- Stability and duality of nonconvex problems via augmented Lagrangian
- Strictly Increasing Positively Homogeneous Functions with Application to Exact Penalization
- Variational Analysis
Cited in
(23)- A conic scalarization method in multi-objective optimization
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- A sharp augmented Lagrangian-based method in constrained non-convex optimization
- Conic scalarization method in multiobjective optimization and relations with other scalarization methods
- A nonlinear programming technique to compute a~tight~lower bound for the real structured singular value
- Stochastic subgradient algorithm for nonsmooth nonconvex optimization
- A new mathematical model and solution method for the asymmetric traveling salesman problem with replenishment arcs
- A polyhedral conic functions based classification method for noisy data
- Existence and characterization theorems in nonconvex vector optimization
- A modified subgradient algorithm for Lagrangean relaxation
- scientific article; zbMATH DE number 2221956 (Why is no real title available?)
- A primal dual modified subgradient algorithm with sharp Lagrangian
- On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization
- Separation theorems for nonconvex sets and application in optimization
- Generalized quadratic multiple knapsack problem and two solution approaches
- Computing the set of optimal points for nonconvex multi-objective optimization problems
- Optimality conditions in nonconvex optimization via weak subdifferentials
- Enhancing sharp augmented Lagrangian methods with smoothing techniques for nonlinear programming
- Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem
- Combined forecasts in portfolio optimization: a generalized approach
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- An overview of advances in combinatorial optimization related topics
- The performance of the modified subgradient algorithm on solving the 0-1 quadratic Knapsack problem
This page was built for publication: The modified subgradient algorithm based on feasible values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5193137)
