A Lagrange duality approach for multi-composed optimization problems
DOI10.1007/S11750-016-0431-2zbMATH Open1376.49045OpenAlexW2511771774MaRDI QIDQ2408520FDOQ2408520
Authors: Gert Wanka, Oleg Wilfer 
Publication date: 12 October 2017
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-016-0431-2
Recommendations
- Conjugate duality for multiobjective composed optimization problems
- Lagrange dualities for robust composite optimization problems
- Augmented Lagrangian duality for composite optimization problems
- On Lagrangian duality for multiparametric programs
- Lagrangian methods for composite optimization
- On the relations between different duals assigned to composed optimization problems
- Nonlinear Lagrange dual for multi-objective programming problems
- Duality and Lagrange multipliers for nonsmooth multiobjective programming
- Duality for multiobjective optimization via nonlinear Lagrangian functions
- Optimality and duality for complex multi-objective programming
conjugate functionsLagrange dualitypower functionscomposed functionsgeneralized interior point regularity conditionsreciprocals of concave functions
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Cites Work
- An alternative formulation for a new closed cone constraint qualification
- Geometric Programming for Communication Systems
- New constraint qualification and conjugate duality for composed convex optimization problems
- A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
- Duality in Vector Optimization
- Regression tasks in machine learning via Fenchel duality
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Stable and total Fenchel duality for convex optimization problems in locally convex spaces
- \(\varepsilon\)-optimality conditions for composed convex optimization problems
- New formulas for the Legendre-Fenchel transform.
- Title not available (Why is that?)
- Duality for minmax programs
- Duality for location problems with unbounded unit balls
- Optimality conditions for portfolio optimization problems with convex deviation measures as objective functions
- A short derivation of the conjugate of a supremum function
- Conjugate duals for power functions
- Title not available (Why is that?)
Cited In (14)
- Conjugate duality for multiobjective composed optimization problems
- On the relations between different duals assigned to composed optimization problems
- Duality results for extended multifacility location problems
- Duality results for nonlinear single minimax location problems via multi-composed optimization
- Title not available (Why is that?)
- Sequential Pareto subdifferential multi-composition rule and application to multiobjective minimax location problems
- Duality and \(\varepsilon \)-optimality conditions for multi-composed optimization problems with applications to fractional and entropy optimization
- Scalar and vector optimization with composed objective functions and constraints
- On uniqueness of Lagrange multipliers in composite optimization
- Multi-composition rule of convex subdifferential calculus
- Augmented Lagrangian duality for composite optimization problems
- Sequential subdifferential for multi-composed functions via perturbation approach
- A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality
- Multifacility minimax location problems via multi-composed optimization
This page was built for publication: A Lagrange duality approach for multi-composed optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408520)
