scientific article; zbMATH DE number 16313
From MaRDI portal
Publication:3972966
[For the entire collection see Zbl 0719.00020.] The author presents a new necessary and sufficient condition for global optimality in nonconvex optimization. The problem addressed is that of minimizing globally a difference \(f=g-h\) of convex functions \(g\) and \(h\), or, which is an equivalent problem, that of maximizing globally a convex function \(h\) on a closed convex set \(C\). The necessary and sufficient conditions for global optimality involve \(\epsilon\)-subdifferentials of the component functions \(g\) and \(h\) (resp. the \(\epsilon\)-subdifferential of \(h\) and the set of \(\epsilon\)-normal directions to the set \(C\)). The conditions truly filter the local minima of \(f\) by the use of the parameter \(\epsilon \geq 0\).
Recommendations
- scientific article; zbMATH DE number 4112402
- Global optimality conditions in nonconvex optimization
- Necessary and sufficient condition on global optimality without convexity and second order differentiability
- Necessary global optimality conditions for nonlinear programming problems
- Global optimality conditions for some classes of optimization problems
Cited in
(only showing first 100 items - show all)- On the subdifferentiability of the difference of two functions and local minimization
- How to regularize a difference of convex functions
- New types of variational principles based on the notion of quasidifferentiability
- Global optimality conditions for nonconvex optimization
- On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization
- A new version of Farkas' lemma and global convex maximization
- A finite algorithm for solving general quadratic problems
- 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
- Approximate Euler-Lagrange inclusion, approximate transversality condition, and sensitivity analysis of convex parametric problems of calculus of variations
- Global optimization conditions for certain nonconvex minimization problems
- On minima of the difference of functions
- A sufficient and necessary condition for nonconvex constrained optimization
- Necessary and sufficient global optimality conditions for convex maximization revisited
- On global optimality conditions and cutting plane algorithms
- On cone d. c. optimization and conjugate duality
- Sufficient conditions for global minimum in nonconvex programming problems
- Permanently going back and forth between the ``quadratic world and the ``convexity world in optimization
- Global minimization of the difference of increasing co-radiant and quasi-concave functions
- On some geometric conditions for minimality of DCH-functions via DC-duality approach
- DC programming and DCA: thirty years of developments
- A general nonconvex multiduality principle
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- Increasing convex-along-rays functions with applications to global optimization
- \(\gamma\)-subdifferential and \(\gamma\)-convexity of functions on a normed space
- 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
- Absence of local minima for a class of nonconvex 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 approximately star-shaped functions and approximate vector variational inequalities
- Methods of embedding-cutting off in problems of mathematical programming
- DC programming: overview.
- Global minimization of the difference of strictly non-positive valued affine ICR functions
- Metric inequality conditions on sets and consequences in optimization
- Classification in the multiple instance learning framework via spherical separation
- New global optimality conditions for nonsmooth DC optimization problems
- The modified second APG method for DC optimization problems
- A difference-of-convex functions approach for sparse PDE optimal control problems with nonconvex costs
- Computation of the epsilon-subdifferential of convex piecewise linear-quadratic functions in optimal worst-case time
- (-)efficiency in difference vector optimization
- \(\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
- Necessary and sufficient condition on global optimality without convexity and second order differentiability
- Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints
- Global optimality conditions in nonconvex optimization
- Differential stability of convex optimization problems with possibly empty solution sets
- On the maximization of (not necessarily) convex functions on convex sets
- Characterization of Lipschitz continuous difference of convex functions
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions
- Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems
- Relationships Between Farthest Point Problem and Best Approximation Problem
- On difference convexity of locally Lipschitz functions
- Closedness conditions for the optimality of a family of non-convex optimization problems
- On global extremum conditions in one non-convex minimization problem
- scientific article; zbMATH DE number 4112402 (Why is no real title available?)
- scientific article; zbMATH DE number 37077 (Why is no real title available?)
- Toland-singer formula cannot distinguish a global minimizer from a choice of stationary points*
- scientific article; zbMATH DE number 569896 (Why is no real title available?)
- Sufficient optimality conditions for a bilevel semivectorial D.C. problem
- Optimality conditions for vector optimization problems with difference of convex maps
- Necessary global optimality conditions for nonlinear programming problems
- An extension to sets of supernormal cones and generalized subdifferential
- scientific article; zbMATH DE number 2116372 (Why is no real title available?)
- Testing optimality for quadratic 0?1 unconstrained problems
- A framework of discrete DC programming by discrete convex analysis
- Approximation of the Rosenblatt process by semimartingales
- Differential stability of convex discrete optimal control problems with possibly empty solution sets
- On the optimality conditions for D.C. vector optimization problems
- Minimizing the difference of two quasiconvex functions over a vector-valued quasiconvex system
- Differential stability of convex optimization problems under weaker conditions
- Convex multilevel decomposition algorithms for non‐monotone problems
- On global unconstrained minimization of the difference of polyhedral functions
- The method of codifferential descent for convex and global piecewise affine optimization
- Simplified optimality conditions for minimizing the difference of vector-valued functions
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
- Cutting methods in E n+ 1 for global optimization of a class of functions
- Duality and optimality conditions for reverse convex programs via a convex decomposition
- The directional subdifferential of the difference of two convex functions
- Differential stability properties of convex optimization and optimal control problems
- On Fenchel c -conjugate dual problems for DC optimization: characterizing weak, strong and stable strong duality
- Cone arcwise connectivity in optimization problems with difference of set-valued mappings
- Approximate optimality conditions and sensitivity analysis in nearly convex optimization
- Optimality conditions for -weak local quasi-efficient solutions of D.C. vector optimization problems
- -weak Pareto minimality in D. C. vector optimization
- On nonconvex optimization
- Necessary and sufficient optimality conditions for reverse quasiconvex programs
- Duality and optimality conditions for generalized equilibrium problems involving DC functions
- Refined optimality conditions for differences of convex functions
- A truncated -subdifferential method for global DC optimization
- Optimality conditions for minimizing the difference of nonconvex vector-valued mappings
- Optimality conditions for vector optimization problems of a difference of convex mappings
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints
- Optimization of the difference of ICR functions
- Optimality conditions for the difference of convex set-valued mappings
- A proximal point algorithm for DC functions on Hadamard manifolds
- Global optimality conditions for some classes of optimization problems
- Robust network design in telecommunications under polytope demand uncertainty
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 Q3972966)
