Pages that link to "Item:Q3972966"
From MaRDI portal
The following pages link to From convex optimization to nonconvex optimization. Necessary and sufficient conditions for global optimality (Q3972966):
Displaying 50 items.
- Optimality conditions for vector optimization problems with difference of convex maps (Q463000) (← links)
- A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
- On global unconstrained minimization of the difference of polyhedral functions (Q540713) (← links)
- The directional subdifferential of the difference of two convex functions (Q628751) (← links)
- On nonconvex optimization (Q696127) (← links)
- Duality and optimality conditions for generalized equilibrium problems involving DC functions (Q708896) (← links)
- Refined optimality conditions for differences of convex functions (Q708908) (← links)
- Optimality conditions for minimizing the difference of nonconvex vector-valued mappings (Q742398) (← links)
- Optimality conditions for vector optimization problems of a difference of convex mappings (Q813348) (← links)
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints (Q816065) (← links)
- Optimization of the difference of ICR functions (Q838045) (← links)
- Optimality conditions for the difference of convex set-valued mappings (Q850590) (← links)
- A proximal point algorithm for DC functions on Hadamard manifolds (Q897056) (← links)
- Global optimality conditions for some classes of optimization problems (Q970570) (← 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)
- How to regularize a difference of convex functions (Q1192766) (← links)
- New types of variational principles based on the notion of quasidifferentiability (Q1193468) (← links)
- Global optimality conditions for nonconvex optimization (Q1265197) (← links)
- On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization (Q1270696) (← links)
- A new version of Farkas' lemma and global convex maximization (Q1312036) (← links)
- A finite algorithm for solving general quadratic problems (Q1315437) (← links)
- Using copositivity for global optimality criteria in concave quadratic programming problems (Q1319026) (← links)
- Limiting behavior of the approximate second-order subdifferential of a convex function (Q1321238) (← links)
- Role of copositivity in optimality criteria for nonconvex optimization problems (Q1321274) (← links)
- Approximate Euler-Lagrange inclusion, approximate transversality condition, and sensitivity analysis of convex parametric problems of calculus of variations (Q1332552) (← links)
- Global optimization conditions for certain nonconvex minimization problems (Q1342899) (← links)
- On minima of the difference of functions (Q1357523) (← links)
- A sufficient and necessary condition for nonconvex constrained optimization (Q1376773) (← links)
- Necessary and sufficient global optimality conditions for convex maximization revisited (Q1378644) (← links)
- On global optimality conditions and cutting plane algorithms (Q1407243) (← links)
- On cone d. c. optimization and conjugate duality (Q1423926) (← links)
- Sufficient conditions for global minimum in nonconvex programming problems (Q1593943) (← links)
- Permanently going back and forth between the ``quadratic world'' and the ``convexity world'' in optimization (Q1599463) (← links)
- Global minimization of the difference of increasing co-radiant and quasi-concave functions (Q1653284) (← links)
- On some geometric conditions for minimality of DCH-functions via DC-duality approach (Q1685589) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- A general nonconvex multiduality principle (Q1752635) (← links)
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations (Q1754446) (← links)
- Increasing convex-along-rays functions with applications to global optimization (Q1807688) (← links)
- \(\gamma\)-subdifferential and \(\gamma\)-convexity of functions on a normed space (Q1896576) (← links)
- A new class of multilevel decomposition algorithms for non-monotone problems based on the quasidifferentiability concept (Q1913139) (← links)
- An algorithm for maximizing a convex function over a simple set (Q1918984) (← links)
- Absence of local minima for a class of nonconvex optimization problems (Q1922649) (← links)
- Characterizing global optimality for DC optimization problems under convex inequality constraints (Q1924070) (← links)
- Subdifferential and optimality conditions for the difference of set-valued mappings (Q1928537) (← links)
- On approximately star-shaped functions and approximate vector variational inequalities (Q1949600) (← links)
- Methods of embedding-cutting off in problems of mathematical programming (Q1959250) (← links)
- DC programming: overview. (Q1969457) (← links)
- Global minimization of the difference of strictly non-positive valued affine ICR functions (Q2018471) (← links)
