Duality in nonconvex optimization
From MaRDI portal
Publication:1256395
DOI10.1016/0022-247X(78)90243-3zbMath0403.90066MaRDI QIDQ1256395
Publication date: 1978
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Related Items
The stable duality of DC programs for composite convex functions ⋮ Duality for nonconvex optimization and its applications ⋮ Some formulae of convex and nonconvex duality ⋮ Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization ⋮ The ABC of DC programming ⋮ Dealing with moment measures via entropy and optimal transport ⋮ Optimization of the difference of ICR functions ⋮ Global optimization conditions for certain nonconvex minimization problems ⋮ Applications of Toland's duality theory to nonconvex optimization problems ⋮ On solving general reverse convex programming problems by a sequence of linear programs and line searches ⋮ An application of the duality theory of Toland to a problem of optimal control ⋮ On minima of the difference of functions ⋮ Global minimization of the difference of increasing co-radiant and quasi-concave functions ⋮ A new class of multilevel decomposition algorithms for non-monotone problems based on the quasidifferentiability concept ⋮ Concave duality: Application to problems dealing with difference of functions ⋮ Testing copositivity with the help of difference-of-convex optimization ⋮ Necessary and sufficient global optimality conditions for convex maximization revisited ⋮ Optimization of the difference of topical functions ⋮ Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver ⋮ Optimality Conditions for the Minimization of Quadratic 0-1 Problems ⋮ Periodic solutions for a class of nonlinear hyperbolic equations ⋮ Total Lagrange duality for DC infinite optimization problems ⋮ A proximal point algorithm for DC functions on Hadamard manifolds ⋮ Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces ⋮ A Generalization of the lasry-lions method for functions in reflexive banach spaces ⋮ First order inertial optimization algorithms with threshold effects associated with dry friction ⋮ The directional subdifferential of the difference of two convex functions ⋮ Sequential difference-of-convex programming ⋮ A new necessary and sufficient global optimality condition for canonical DC problems ⋮ Solving polyhedral d.c. optimization problems via concave minimization ⋮ Unnamed Item ⋮ Global optimality conditions for optimal control problems with functions of A.D. Alexandrov ⋮ Conjugaison par tranches et dualitë de toland ⋮ The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions ⋮ Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies ⋮ Non-convex methods for computing free boundary equilibria of axially symmetric plasmas ⋮ DC programming: overview. ⋮ Farkas-type results for constrained fractional programming with DC functions ⋮ On a smooth dual gap function for a class of quasi-variational inequalities ⋮ On a smooth dual gap function for a class of player convex generalized Nash equilibrium problems ⋮ A new variational principle and duality for periodic solutions of Hamilton's equations ⋮ An extension of D.C. duality theory, with an appendix on ∗-subdifferentials ⋮ Relationships Between Farthest Point Problem and Best Approximation Problem ⋮ On the convexification procedure for nonconvex and nonsmooth infinite dimensional optimization problems ⋮ How to regularize a difference of convex functions ⋮ Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ A general nonconvex multiduality principle ⋮ A generalized duality and applications ⋮ An abstract symmetric framework for duality in mathematical programming ⋮ Non-convex self-dual Lagrangians: new variational principles of symmetric boundary value problems ⋮ A closedness condition and its applications to DC programs with convex constraints ⋮ A class of semi-supervised support vector machines by DC programming ⋮ Duality principles for optimization problems dealing with the difference of vector-valued convex mappings ⋮ Locating a semi-obnoxious facility in the special case of Manhattan distances ⋮ Robust network design in telecommunications under polytope demand uncertainty ⋮ Duality and optimality conditions for generalized equilibrium problems involving DC functions ⋮ The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems ⋮ Duality and classical problem of the calculus of variations without convexity assumptions ⋮ Unnamed Item ⋮ Abstract convexity:examples and applications ⋮ Numerical Approximations of the Relative Rearrangement: The piecewise linear case. Application to some Nonlocal Problems ⋮ Duality for nonsmooth mathematical programming problems with equilibrium constraints ⋮ On the subdifferentiability of the difference of two functions and local minimization ⋮ On Algorithms for Difference of Monotone Operators ⋮ On Algorithms for Difference of Monotone Operators ⋮ A formula on the conjugate of the max of a convex functions and a concave function ⋮ Perfect duality theory and complete solutions to a class of global optimization problems* ⋮ Unnamed Item ⋮ On difference convexity of locally Lipschitz functions ⋮ Periodic solutions of nonlinear vibrating strings and duality principles ⋮ A general double-proximal gradient algorithm for d.c. programming ⋮ Dual Randomized Coordinate Descent Method for Solving a Class of Nonconvex Problems ⋮ Duality for non-convex variational principles ⋮ A smooth dual gap function solution to a class of quasivariational inequalities ⋮ Analytic solutions and triality theory for nonconvex and nonsmooth variational problems with applications ⋮ Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming ⋮ The conjugate of the difference of convex functions ⋮ Dualities ⋮ Toland-singer formula cannot distinguish a global minimizer from a choice of stationary points* ⋮ Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
Cites Work
