scientific article
From MaRDI portal
Publication:3208459
zbMath0417.90088MaRDI QIDQ3208459
Publication date: 1979
Full work available at URL: http://www.numdam.org/item?id=MSMF_1979__60__177_0
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
dualitynon-convex optimizationprogramming in abstract spaceslinear topological vector spacessubdifferential calulus
Programming in abstract spaces (90C48) Duality theory for topological vector spaces (46A20) Topological linear spaces and related structures (46A99)
Related Items
Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints, Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres, A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem, On some geometric conditions for minimality of DCH-functions via DC-duality approach, Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm, Finding robust minimizer for non-convex phase retrieval, The directional subdifferential of the difference of two convex functions, A branch-and-bound algorithm embedded with DCA for DC programming, An augmented subgradient method for minimizing nonsmooth DC functions, DC decomposition of nonconvex polynomials with algebraic techniques, Non-convex self-dual Lagrangians and variational principles for certain PDE's, On global unconstrained minimization of the difference of polyhedral functions, The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems, Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming, On the subdifferentiability of the difference of two functions and local minimization, The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions, Numerical solution for optimization over the efficient set by d.c. optimization algorithms, The conjugate of the difference of convex functions
Cites Work
