scientific article
From MaRDI portal
Publication:3972966
zbMath0735.90056MaRDI QIDQ3972966
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
nonconvex optimizationglobal optimalitynecessary and sufficient condition\(\epsilon\)-subdifferentialsdc-programming
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48) Variational principles in infinite-dimensional spaces (58E30) Optimality conditions for problems in abstract spaces (49K27)
Related Items
Approximate Euler-Lagrange inclusion, approximate transversality condition, and sensitivity analysis of convex parametric problems of calculus of variations, \(\gamma\)-subdifferential and \(\gamma\)-convexity of functions on the real line, New existence results for efficient points in locally convex spaces ordered by supernormal cones, Convex multilevel decomposition algorithms for non‐monotone problems, Optimization of the difference of ICR functions, Global optimization conditions for certain nonconvex minimization problems, \(\gamma\)-subdifferential and \(\gamma\)-convexity of functions on a normed space, Optimality conditions for the difference of convex set-valued mappings, DC semidefinite programming and cone constrained DC optimization. I: Theory, On minima of the difference of functions, Classification in the multiple instance learning framework via spherical separation, Global minimization of the difference of increasing co-radiant and quasi-concave functions, Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints, A new class of multilevel decomposition algorithms for non-monotone problems based on the quasidifferentiability concept, An algorithm for maximizing a convex function over a simple set, Necessary and sufficient global optimality conditions for convex maximization revisited, Differential stability of convex discrete optimal control problems with possibly empty solution sets, On the optimality conditions for D.C. vector optimization problems, Characterizing global optimality for DC optimization problems under convex inequality constraints, Subdifferential and optimality conditions for the difference of set-valued mappings, On some geometric conditions for minimality of DCH-functions via DC-duality approach, Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines, On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions, Differential stability of convex optimization problems with possibly empty solution sets, A proximal point algorithm for DC functions on Hadamard manifolds, Cutting methods in E n+ 1 for global optimization of a class of functions, Testing optimality for quadratic 0?1 unconstrained problems, Minimizing the difference of two quasiconvex functions over a vector-valued quasiconvex system, The directional subdifferential of the difference of two convex functions, Duality and optimality conditions for reverse convex programs via a convex decomposition, On global optimality conditions and cutting plane algorithms, On the maximization of (not necessarily) convex functions on convex sets, On approximately star-shaped functions and approximate vector variational inequalities, Characterization of Lipschitz continuous difference of convex functions, Methods of embedding-cutting off in problems of mathematical programming, On cone d. c. optimization and conjugate duality, Optimality conditions for vector optimization problems with difference of convex maps, Sufficient Optimality Conditions for a Bilevel Semivectorial D.C. Problem, DC programming: overview., A framework of discrete DC programming by discrete convex analysis, Relationships Between Farthest Point Problem and Best Approximation Problem, How to regularize a difference of convex functions, New types of variational principles based on the notion of quasidifferentiability, DC programming and DCA: thirty years of developments, A general nonconvex multiduality principle, Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations, On global unconstrained minimization of the difference of polyhedral functions, Robust network design in telecommunications under polytope demand uncertainty, Simplified optimality conditions for minimizing the difference of vector-valued functions, Duality and optimality conditions for generalized equilibrium problems involving DC functions, Refined optimality conditions for differences of convex functions, Global minimization of the difference of strictly non-positive valued affine ICR functions, On the subdifferentiability of the difference of two functions and local minimization, Differential stability of convex optimization problems under weaker conditions, Metric inequality conditions on sets and consequences in optimization, Optimality conditions for minimizing the difference of nonconvex vector-valued mappings, Increasing convex-along-rays functions with applications to global optimization, New global optimality conditions for nonsmooth DC optimization problems, Approximation of the Rosenblatt process by semimartingales, On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization, The modified second APG method for DC optimization problems, A difference-of-convex functions approach for sparse PDE optimal control problems with nonconvex costs, On difference convexity of locally Lipschitz functions, Numerical solution for optimization over the efficient set by d.c. optimization algorithms, Computation of the epsilon-subdifferential of convex piecewise linear-quadratic functions in optimal worst-case time, The method of codifferential descent for convex and global piecewise affine optimization, (\(\epsilon\)-)efficiency in difference vector optimization, A new version of Farkas' lemma and global convex maximization, An extension to sets of supernormal cones and generalized subdifferential, A finite algorithm for solving general quadratic problems, Toland-singer formula cannot distinguish a global minimizer from a choice of stationary points*, Using copositivity for global optimality criteria in concave quadratic programming problems, Limiting behavior of the approximate second-order subdifferential of a convex function, Role of copositivity in optimality criteria for nonconvex optimization problems, Optimality conditions for vector optimization problems of a difference of convex mappings, Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems, Optimality conditions for D.C. vector optimization problems under reverse convex constraints
