Duality for composite optimization problem within the framework of abstract convexity

DOI10.1080/02331934.2022.2132822MaRDI QIDQ5879567OpenAlexFDO

Authors the Hung Tran, Ewa M. Bednarczuk

Publication date 2 March 2023

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2209.02177

zbMATH Keywords

global optimizationabstract convexityLagrange dual\(\varepsilon\)-subdifferentialsconjugate dual

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)

Recommendations

• Conjugate duality for constrained vector optimization in abstract convex frame
• Conjugate duality for constrained optimization via image space analysis and abstract convexity
• Study on the Lagrange dualities for composite optimization problems with conical constraints
• Zero duality gap property for convex composite optimization problems
• Zero duality gap properties for DC composite optimization problem

Cites work

• scientific article; zbMATH DE number 994348 (Why is no real title available?)
• scientific article; zbMATH DE number 5296129 (Why is no real title available?)
• scientific article; zbMATH DE number 3626130 (Why is no real title available?)
• scientific article; zbMATH DE number 1017537 (Why is no real title available?)
• scientific article; zbMATH DE number 1791177 (Why is no real title available?)
• scientific article; zbMATH DE number 1376935 (Why is no real title available?)
• A survey of methods of abstract convex programming
• Abstract Convexity and Augmented Lagrangians
• Abstract convex approximations of nonsmooth functions
• Approximate convexity and submonotonicity.
• Approximately Convex Functions
• Approximation and regularization of arbitrary functions in Hilbert spaces by the Lasry-Lions method
• Conjugate functions for convex and nonconvex duality
• Convex analysis and monotone operator theory in Hilbert spaces
• Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
• Further study on augmented Lagrangian duality theory
• Generalized Fenchel's conjugation formulas and duality for abstract convex functions
• Inf-convolution, sous-additivite, convexite des fonctions numériques
• Maximal abstract monotonicity and generalized Fenchel's conjugation formulas
• Minimax theorems for \(\Phi\)-convex functions: sufficient and necessary conditions
• Minimax theorems for extended real-valued abstract convex-concave functions
• Minimizing increasing star-shaped functions based on abstract convexity
• Monotonic Analysis over Cones: I
• On approximately convex functions
• On duality for nonconvex minimization problems within the framework of abstract convexity
• Semiconcave functions, Hamilton-Jacobi equations, and optimal control
• Strong and Weak Convexity of Sets and Functions
• Support points of lower semicontinuous functions with respect to the set of Lipschitz concave functions
• The Zero Duality Gap Property and Lower Semicontinuity of the Perturbation Function
• Zero duality gap conditions via abstract convexity

Cited in

(8)

• Zero duality gap property for convex composite optimization problems
• Conjugate duality for constrained optimization via image space analysis and abstract convexity
• Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems
• Duality for Composite Optimization Problem within the Framework of Abstract Convexity
• Zero duality gap conditions via abstract convexity
• Conjugate duality for constrained vector optimization in abstract convex frame
• scientific article; zbMATH DE number 6500589 (Why is no real title available?)
• Abstract Convexity and Augmented Lagrangians

This page was built for publication: Duality for composite optimization problem within the framework of abstract convexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5879567)