scientific article

zbMath0591.90073MaRDI QIDQ3720308

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

survey generalized differentiability difference of two convex functions locally Lipschitz functions duality results d.c. functions differential properties

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Duality theory (optimization) (49N15) Continuity and differentiation questions (26B05) Convexity of real functions of several variables, generalizations (26B25)

Related Items

Generalized submonotonicity and approximately convexity in Riemannian manifolds, Two characterizations of super-reflexive Banach spaces by the behaviour of differences of convex functions, The proximal point method with a vectorial Bregman regularization in multiobjective DC programming, On global search in nonconvex optimal control problems, A DC approach for minimax fractional optimization programs with ratios of convex functions, Modern methods for solving nonconvex optimal control problems, A general cone decomposition theory based on efficiency, The ABC of DC programming, Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions, Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints, On local search in d.c. optimization problems, Global optimization conditions for certain nonconvex minimization problems, Interpolation results for pathwise Hamilton-Jacobi equations, A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem, A revision of the rectangular algorithm for a class of DC optimization problems, Deletion-by-infeasibility rule for DC-constrained global optimization, The DTC (difference of tangentially convex functions) programming: optimality conditions, DC semidefinite programming and cone constrained DC optimization. I: Theory, Unnamed Item, ON THE CONVERGENCE RATE OF POTENTIALS OF BRENIER MAPS, From quasidifferentiable to directed subdifferentiable functions: exact calculus rules, Positively homogeneous functions revisited, A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations, A new class of multilevel decomposition algorithms for non-monotone problems based on the quasidifferentiability concept, Concave duality: Application to problems dealing with difference of functions, A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes, Moreau's decomposition theorem revisited, Second order epi derivatives and the Dupin indicatrix for nonsmooth functions, On a DC-optimization-problem from statistical factor analysis, Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver, Global optimality conditions in nonconvex optimization, Upper DSL approximates and nonsmooth optimization, On some geometric conditions for minimality of DCH-functions via DC-duality approach, Generalized second-order derivatives and optimality conditions, Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines, Nonconvex evolution inclusions governed by the difference of two subdifferentials, On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions, Global optimality conditions and exact penalization, A modified proximal point method for DC functions on Hadamard manifolds, Computation of the maximum likelihood estimator in low-rank factor analysis, A bundle-type method for nonsmooth DC programs, A refined inertial DC algorithm for DC programming, On Quasidifferentiable Functions and Non-Differentiable Programming, A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program, Sequential difference-of-convex programming, Canonical Duality-Triality Theory: Unified Understanding for Modeling, Problems, and NP-Hardness in Global Optimization of Multi-Scale Systems, Characterization and recognition of d.c. functions, Global optimality conditions for optimal control problems with functions of A.D. Alexandrov, Characterization of d.c. Functions in terms of quasidifferentials, Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies, Approximate convexity and submonotonicity., The directed and Rubinov subdifferentials of quasidifferentiable functions. I: Definition and examples, DC programming: overview., On Computing the Mordukhovich Subdifferential Using Directed Sets in Two Dimensions, Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions, On modeling and global solutions for d.c. optimization problems by canonical duality theory, Computing a global optimal solution to a design centering problem, A computational comparison of some branch and bound methods for indefinite quadratic programs, A framework of discrete DC programming by discrete convex analysis, On the pervasiveness of difference-convexity in optimization and statistics, On solving a d.c. programming problem by a sequence of linear programs, Maps with the Radon-Nikodým property, How to regularize a difference of convex functions, DC decomposition of nonconvex polynomials with algebraic techniques, Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity, Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis., Optimization of the norm of a vector-valued DC function and applications, Extension of primal-dual interior point methods to diff-convex problems on symmetric cones, Non-convex self-dual Lagrangians: new variational principles of symmetric boundary value problems, Quadratic Majorization for Nonconvex Loss with Applications to the Boosting Algorithm, Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function, Proximal bundle methods for nonsmooth DC programming, Sums of increasing convex and increasing concave functions, The formulas for the representation of functions of two variables as a difference of sublinear functions, An inertial algorithm for DC programming, Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming, A local search method for optimization problem with d.c. inequality constraints, A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems, Difference of convex solution of quadratically constrained optimization problems., Roots of Gårding hyperbolic polynomials, On difference convexity of locally Lipschitz functions, A smooth dual gap function solution to a class of quasivariational inequalities, Stability and Error Analysis for Optimization and Generalized Equations, Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming, Polyhedral separation via difference of convex (DC) programming, (\(\epsilon\)-)efficiency in difference vector optimization, Global optimization algorithms for linearly constrained indefinite quadratic problems, Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications, On the representability of a function of two variables as the difference of two convex functions, Decomposition methods for solving nonconvex quadratic programs via branch and bound, A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems, On strongly quasiconvex functions: existence results and proximal point algorithms, Area theorem and smoothness of compact Cauchy horizons, A local search scheme for the inequality-constrained optimal control problem