default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 169
Volume 169, Number 1, May 2018
- Hoai An Le Thi
, Tao Pham Dinh:
Preface. 1-4 - Hoai An Le Thi, Tao Pham Dinh:
DC programming and DCA: thirty years of developments. 5-68 - Amir Ali Ahmadi, Georgina Hall:
DC decomposition of nonconvex polynomials with algebraic techniques. 69-94 - Francisco J. Aragón Artacho, Ronan M. T. Fleming, Phan Tu Vuong:
Accelerating the DC algorithm for smooth functions. 95-118 - Emilio Carrizosa, Vanesa Guerrero, Dolores Romero Morales:
Visualizing data as objects by DC (difference of convex) optimization. 119-140 - Jun-ya Gotoh, Akiko Takeda, Katsuya Tono:
DC formulations and algorithms for sparse optimization problems. 141-176 - Jae-Hyoung Lee, Gue Myung Lee:
On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint. 177-198 - Takanori Maehara, Naoki Marumo, Kazuo Murota:
Continuous relaxation for discrete DC programming. 199-219 - Francisco Jara-Moroni, Jong-Shi Pang, Andreas Wächter:
A study of the difference-of-convex approach for solving linear programs with complementarity constraints. 221-254 - Chenchen Wu, Yishui Wang, Zaixin Lu, Panos M. Pardalos, Dachuan Xu, Zhao Zhang, Ding-Zhu Du:
Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming. 255-275 - Chong Zhang, Minh Pham, Sheng Fu, Yufeng Liu:
Robust multicategory support vector machines using difference convex algorithm. 277-305 - Shuai Zhang, Jack Xin:
Minimization of transformed L1 penalty: theory, difference of convex function algorithm, and robust application in compressed sensing. 307-336
Volume 169, Number 2, June 2018
- Coralia Cartis, Katya Scheinberg:
Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. 337-375 - Trang T. Nguyen, Jean-Philippe P. Richard, Mohit Tawarmalani:
Deriving convex hulls through lifting and projection. 377-415 - Anja Fischer, Frank Fischer, S. Thomas McCormick:
Matroid optimisation problems with nested non-linear monomials in the objective function. 417-446 - Ruobing Chen, Matt Menickelly, Katya Scheinberg:
Stochastic optimization using a trust-region method and random models. 447-487 - Huifu Xu, Yongchao Liu, Hailin Sun:
Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods. 489-529 - Rujun Jiang, Duan Li, Baiyi Wu:
SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices. 531-563 - Jörg Bader, Robert Hildebrand, Robert Weismantel, Rico Zenklusen:
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix. 565-584 - Gokhan Kirlik, Serpil Sayin:
Bilevel programming for generating discrete representations in multiobjective optimization. 585-604 - Boris S. Mordukhovich, M. Ebrahim Sarabi:
Critical multipliers in variational systems via second-order generalized differentiation. 605-648 - Omar El Housni, Vineet Goyal:
Piecewise static policies for two-stage adjustable robust linear optimization. 649-665
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-26 00:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
