Pages that link to "Item:Q2494475"

The following pages link to On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian (Q2494475):

Displaying 26 items.

• Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality (Q480827) (← links)
• Optimization over the efficient set of multi-objective convex optimal control problems (Q607889) (← links)
• An augmented penalty function method with penalty parameter updates for nonconvex optimization (Q654058) (← links)
• Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle (Q1683693) (← links)
• A non-local topology-preserving segmentation-guided registration model (Q1704004) (← links)
• A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm (Q1721580) (← links)
• Combined forecasts in portfolio optimization: a generalized approach (Q1762047) (← links)
• An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians (Q1955564) (← links)
• Revisiting augmented Lagrangian duals (Q2097636) (← links)
• An inexact modified subgradient algorithm for nonconvex optimization (Q2268922) (← links)
• A primal dual modified subgradient algorithm with sharp Lagrangian (Q2268932) (← links)
• A flexible inexact-restoration method for constrained optimization (Q2346395) (← links)
• The maximum principle for the nonlinear stochastic optimal control problem of switching systems (Q2392780) (← links)
• A nonlinear programming technique to compute a~tight~lower bound for the real structured singular value (Q2443367) (← links)
• Inexact subgradient methods for quasi-convex optimization problems (Q2629635) (← links)
• Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster (Q2668769) (← links)
• A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems (Q2795104) (← links)
• A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods (Q2995265) (← links)
• On primal convergence for augmented Lagrangian duality (Q3112497) (← links)
• A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems (Q3112505) (← 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)
• A primal–dual penalty method via rounded weighted-ℓ₁ Lagrangian duality (Q5054741) (← links)
• The modified subgradient algorithm based on feasible values (Q5193137) (← links)
• The exact penalty map for nonsmooth and nonconvex optimization (Q5248198) (← links)
• Decomposition methods for global solution of mixed-integer linear programs (Q6490313) (← links)