Preface.
- Published in:
- Mathematical Programming, 2018, v. 169, n. 1, p. 1, doi. 10.1007/s10107-018-1268-2
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2018 AND VI 169 AND IP 1
Results: 12
1
2
Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming.
- Published in:
- Mathematical Programming, 2018, v. 169, n. 1, p. 255, doi. 10.1007/s10107-018-1242-z
- By:
- Publication type:
- Article
3
Minimization of transformed L1 penalty: theory, difference of convex function algorithm, and robust application in compressed sensing.
- Published in:
- Mathematical Programming, 2018, v. 169, n. 1, p. 307, doi. 10.1007/s10107-018-1236-x
- By:
- Publication type:
- Article
4
DC programming and DCA: thirty years of developments.
- Published in:
- Mathematical Programming, 2018, v. 169, n. 1, p. 5, doi. 10.1007/s10107-018-1235-y
- By:
- Publication type:
- Article
5
On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint.
- Published in:
- Mathematical Programming, 2018, v. 169, n. 1, p. 177, doi. 10.1007/s10107-017-1210-z
- By:
- Publication type:
- Article
6
Robust multicategory support vector machines using difference convex algorithm.
- Published in:
- Mathematical Programming, 2018, v. 169, n. 1, p. 277, doi. 10.1007/s10107-017-1209-5
- By:
- Publication type:
- Article
7
A study of the difference-of-convex approach for solving linear programs with complementarity constraints.
- Published in:
- Mathematical Programming, 2018, v. 169, n. 1, p. 221, doi. 10.1007/s10107-017-1208-6
- By:
- Publication type:
- Article
8
DC formulations and algorithms for sparse optimization problems.
- Published in:
- Mathematical Programming, 2018, v. 169, n. 1, p. 141, doi. 10.1007/s10107-017-1181-0
- By:
- Publication type:
- Article
9
Accelerating the DC algorithm for smooth functions.
- Published in:
- Mathematical Programming, 2018, v. 169, n. 1, p. 95, doi. 10.1007/s10107-017-1180-1
- By:
- Publication type:
- Article
10
Visualizing data as objects by DC (difference of convex) optimization.
- Published in:
- Mathematical Programming, 2018, v. 169, n. 1, p. 119, doi. 10.1007/s10107-017-1156-1
- By:
- Publication type:
- Article
11
DC decomposition of nonconvex polynomials with algebraic techniques.
- Published in:
- Mathematical Programming, 2018, v. 169, n. 1, p. 69, doi. 10.1007/s10107-017-1144-5
- By:
- Publication type:
- Article
12
Continuous relaxation for discrete DC programming.
- Published in:
- Mathematical Programming, 2018, v. 169, n. 1, p. 199, doi. 10.1007/s10107-017-1139-2
- By:
- Publication type:
- Article