scientific article; zbMATH DE number 3650320

zbMATH Open0417.90088MaRDI QIDQ3208459FDOQ3208459

Authors: John F. Toland 

Publication date: 1979

Full work available at URL: http://www.numdam.org/item?id=MSMF_1979__60__177_0

Title of this publication is not available (Why is that?)

zbMATH Keywords

non-convex optimizationdualityprogramming in abstract spaceslinear topological vector spacessubdifferential calulus

Mathematics Subject Classification ID

Programming in abstract spaces (90C48) Duality theory for topological vector spaces (46A20) Topological linear spaces and related structures (46A99)

Cites Work

• Duality in nonconvex optimization
• A duality principle for non-convex optimisation and the calculus of variations
• On the stability of rotating heavy chains

Cited In (19)

• Non-convex self-dual Lagrangians and variational principles for certain PDE's
• A boosted DC algorithm for non-differentiable DC components with non-monotone line search
• An augmented subgradient method for minimizing nonsmooth DC functions
• Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
• DC decomposition of nonconvex polynomials with algebraic techniques
• The directional subdifferential of the difference of two convex functions
• Double bundle method for finding Clarke stationary points in nonsmooth DC programming
• On the subdifferentiability of the difference of two functions and local minimization
• A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
• Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• A branch-and-bound algorithm embedded with DCA for DC programming
• Numerical solution for optimization over the efficient set by d.c. optimization algorithms
• Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
• Finding robust minimizer for non-convex phase retrieval
• The conjugate of the difference of convex functions
• On some geometric conditions for minimality of DCH-functions via DC-duality approach
• On global unconstrained minimization of the difference of polyhedral functions
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions

This page was built for publication:

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