The following pages link to (Q3720308):
Displaying 50 items.
- Quadratic Majorization for Nonconvex Loss with Applications to the Boosting Algorithm (Q82722) (← links)
- On global search in nonconvex optimal control problems (Q276516) (← links)
- Modern methods for solving nonconvex optimal control problems (Q278529) (← links)
- On local search in d.c. optimization problems (Q299416) (← links)
- From quasidifferentiable to directed subdifferentiable functions: exact calculus rules (Q346799) (← links)
- Positively homogeneous functions revisited (Q346810) (← links)
- A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
- Non-convex self-dual Lagrangians: new variational principles of symmetric boundary value problems (Q531825) (← links)
- Sums of increasing convex and increasing concave functions (Q581222) (← links)
- Characterization of d.c. Functions in terms of quasidifferentials (Q640206) (← links)
- The directed and Rubinov subdifferentials of quasidifferentiable functions. I: Definition and examples (Q654048) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications (Q811400) (← links)
- Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← links)
- The ABC of DC programming (Q829493) (← links)
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions (Q831364) (← links)
- A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
- Concave duality: Application to problems dealing with difference of functions (Q1116083) (← links)
- Moreau's decomposition theorem revisited (Q1122509) (← links)
- Computing a global optimal solution to a design centering problem (Q1184340) (← links)
- On solving a d.c. programming problem by a sequence of linear programs (Q1186273) (← links)
- How to regularize a difference of convex functions (Q1192766) (← links)
- A smooth dual gap function solution to a class of quasivariational inequalities (Q1300044) (← links)
- A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems (Q1321648) (← links)
- A general cone decomposition theory based on efficiency (Q1334950) (← links)
- Global optimization conditions for certain nonconvex minimization problems (Q1342899) (← links)
- Approximate convexity and submonotonicity. (Q1426084) (← links)
- Two characterizations of super-reflexive Banach spaces by the behaviour of differences of convex functions (Q1614767) (← links)
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints (Q1630269) (← links)
- Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver (Q1679488) (← links)
- On some geometric conditions for minimality of DCH-functions via DC-duality approach (Q1685589) (← links)
- Further application of \(H\)-differentiability to generalized complementarity problems based on generalized Fisher-Burmeister functions (Q1724181) (← links)
- On modeling and global solutions for d.c. optimization problems by canonical duality theory (Q1734755) (← links)
- On the pervasiveness of difference-convexity in optimization and statistics (Q1739035) (← links)
- Maps with the Radon-Nikodým property (Q1745914) (← links)
- DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
- Difference of convex solution of quadratically constrained optimization problems. (Q1810525) (← links)
- Rigorous convex underestimators for general twice-differentiable problems (Q1817315) (← links)
- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem (Q1890947) (← links)
- Deletion-by-infeasibility rule for DC-constrained global optimization (Q1893323) (← links)
- A new class of multilevel decomposition algorithms for non-monotone problems based on the quasidifferentiability concept (Q1913139) (← links)
- DC programming: overview. (Q1969457) (← links)
- Polyhedral separation via difference of convex (DC) programming (Q2100399) (← links)
- On strongly quasiconvex functions: existence results and proximal point algorithms (Q2116608) (← links)
- A local search scheme for the inequality-constrained optimal control problem (Q2117613) (← links)
- Generalized submonotonicity and approximately convexity in Riemannian manifolds (Q2120264) (← links)
- A revision of the rectangular algorithm for a class of DC optimization problems (Q2141721) (← links)
- The DTC (difference of tangentially convex functions) programming: optimality conditions (Q2146366) (← links)
- DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
- A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations (Q2163076) (← links)
