The following pages link to Duality in nonconvex optimization (Q1256395):
Displaying 50 items.
- Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization (Q280088) (← links)
- Dealing with moment measures via entropy and optimal transport (Q285820) (← links)
- Testing copositivity with the help of difference-of-convex optimization (Q359631) (← links)
- Optimization of the difference of topical functions (Q386462) (← links)
- Total Lagrange duality for DC infinite optimization problems (Q401875) (← links)
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces (Q413608) (← links)
- Farkas-type results for constrained fractional programming with DC functions (Q479261) (← links)
- On a smooth dual gap function for a class of quasi-variational inequalities (Q481765) (← links)
- On a smooth dual gap function for a class of player convex generalized Nash equilibrium problems (Q493045) (← links)
- Non-convex self-dual Lagrangians: new variational principles of symmetric boundary value problems (Q531825) (← links)
- The directional subdifferential of the difference of two convex functions (Q628751) (← links)
- A generalized duality and applications (Q686992) (← links)
- Duality principles for optimization problems dealing with the difference of vector-valued convex mappings (Q700772) (← links)
- Duality and optimality conditions for generalized equilibrium problems involving DC functions (Q708896) (← links)
- Duality for non-convex variational principles (Q789713) (← links)
- Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications (Q811400) (← links)
- The ABC of DC programming (Q829493) (← links)
- Optimization of the difference of ICR functions (Q838045) (← links)
- A proximal point algorithm for DC functions on Hadamard manifolds (Q897056) (← links)
- Robust network design in telecommunications under polytope demand uncertainty (Q976502) (← links)
- On the subdifferentiability of the difference of two functions and local minimization (Q1005123) (← links)
- The conjugate of the difference of convex functions (Q1061004) (← links)
- Concave duality: Application to problems dealing with difference of functions (Q1116083) (← links)
- Non-convex methods for computing free boundary equilibria of axially symmetric plasmas (Q1169801) (← links)
- A new variational principle and duality for periodic solutions of Hamilton's equations (Q1188235) (← links)
- On the convexification procedure for nonconvex and nonsmooth infinite dimensional optimization problems (Q1190317) (← links)
- How to regularize a difference of convex functions (Q1192766) (← links)
- A formula on the conjugate of the max of a convex functions and a concave function (Q1269649) (← links)
- A smooth dual gap function solution to a class of quasivariational inequalities (Q1300044) (← links)
- Duality for nonconvex optimization and its applications (Q1329205) (← links)
- Some formulae of convex and nonconvex duality (Q1332557) (← links)
- Global optimization conditions for certain nonconvex minimization problems (Q1342899) (← links)
- On minima of the difference of functions (Q1357523) (← links)
- Necessary and sufficient global optimality conditions for convex maximization revisited (Q1378644) (← links)
- Analytic solutions and triality theory for nonconvex and nonsmooth variational problems with applications (Q1586659) (← links)
- Global minimization of the difference of increasing co-radiant and quasi-concave functions (Q1653284) (← links)
- Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver (Q1679488) (← links)
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
- A general nonconvex multiduality principle (Q1752635) (← links)
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
- A new class of multilevel decomposition algorithms for non-monotone problems based on the quasidifferentiability concept (Q1913139) (← links)
- A new necessary and sufficient global optimality condition for canonical DC problems (Q1945515) (← links)
- DC programming: overview. (Q1969457) (← links)
- Locating a semi-obnoxious facility in the special case of Manhattan distances (Q2009180) (← links)
- Sequential difference-of-convex programming (Q2198538) (← links)
- Solving polyhedral d.c. optimization problems via concave minimization (Q2200081) (← links)
- A class of semi-supervised support vector machines by DC programming (Q2256780) (← links)
- A general double-proximal gradient algorithm for d.c. programming (Q2330650) (← links)
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming (Q2338781) (← links)
- The stable duality of DC programs for composite convex functions (Q2358470) (← links)
