Results 91 to 100 of about 173 (143)
Duality in nonlinear programming problems under fuzzy environment with exponential membership functions. [PDF]
J Inequal Appl, 2018 Gupta SK +3 more
europepmc +1 more source
, 1998 The convergence and the complexity of a primal-dual column generation and cutting plane algorithm from approximate analytic centers for solving convex feasibility problems defined by a "deep cut" separation oracle is studied.
Faranak Sharifi-Mokhtarian +1 more
core
Sample Average Approximation with Sparsity-Inducing Penalty for High-Dimensional Stochastic Programming. [PDF]
Math Program, 2019 Liu H, Wang X, Yao T, Li R, Ye Y.
europepmc +1 more source
Saddle Points and Pareto Points in Multiple Objective Programming
, 2007 In this paper relationships between Pareto points and saddle points in multiple objective programming are investigated. Convex and nonconvex problems are considered and the equivalence between Pareto points and saddle points is proved in both cases.
Matthias Ehrgott, Margaret M. Wiecek
core
Relaxation via separable estimators: arithmetic and implementation. [PDF]
J Glob OptimZha Y +3 more
europepmc +1 more source
A general double-proximal gradient algorithm for d.c. programming. [PDF]
Math Program, 2019 Banert S, Boț RI.
europepmc +1 more source
A Derivative-Free Line Search and Global Convergence of Broyden-Like Method for Nonlinear Equations
, 1999 In this paper, by using derivative-free line search, we propose quasi-Newton methods for smooth nonlinear equations. Under appropriate conditions, we show that the proposed quasi-Newton methods converge globally and superlinearly.
Dong-hui Li, Masao Fukushima
core
Constrained consensus-based optimization and numerical heuristics for the few particle regime. [PDF]
J Glob OptimBeddrich J +4 more
europepmc +1 more source