Pages that link to "Item:Q5193137"
From MaRDI portal
The following pages link to The modified subgradient algorithm based on feasible values (Q5193137):
Displayed 14 items.
- Generalized quadratic multiple knapsack problem and two solution approaches (Q336889) (← links)
- Optimality conditions in nonconvex optimization via weak subdifferentials (Q631730) (← links)
- Combined forecasts in portfolio optimization: a generalized approach (Q1762047) (← links)
- On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization (Q2216183) (← links)
- Separation theorems for nonconvex sets and application in optimization (Q2294382) (← links)
- Existence and characterization theorems in nonconvex vector optimization (Q2350078) (← links)
- A conic scalarization method in multi-objective optimization (Q2392759) (← links)
- A nonlinear programming technique to compute a~tight~lower bound for the real structured singular value (Q2443367) (← links)
- A polyhedral conic functions based classification method for noisy data (Q2666735) (← links)
- Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem (Q2668735) (← links)
- A sharp augmented Lagrangian-based method in constrained non-convex optimization (Q4631763) (← links)
- Weak subgradient method for solving nonsmooth nonconvex optimization problems (Q5009157) (← links)
- Conic Scalarization Method in Multiobjective Optimization and Relations with Other Scalarization Methods (Q5356996) (← links)
- An overview of advances in combinatorial optimization related topics (Q5746672) (← links)