The following pages link to Dorel I. Duca (Q453626):
Displaying 50 items.
- Saddle points for vector valued functions: existence, necessary and sufficient theorems (Q453628) (← links)
- On convergence of two-stage splitting methods for linear complementarity problems (Q557714) (← links)
- A filled function method for finding a global minimizer on global integer optimization (Q557731) (← links)
- Probabilistic subproblem selection in branch-and-bound algorithms (Q557739) (← links)
- (Q752007) (redirect page) (← links)
- Optimization of bicriterion quasi-concave function subject to linear constraints (Q752008) (← links)
- Active set algorithms for isotonic regression; a unifying framework (Q752010) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- Generalized bilinear programming. I: Models, applications and linear programming relaxation (Q1199512) (← links)
- A linear programming approach to solving bilinear programmes (Q1207310) (← links)
- Incremental gradient algorithms with stepsizes bounded away from zero (Q1273418) (← links)
- A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set (Q1319684) (← links)
- A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668) (← links)
- Modifying the BFGS update by a new column scaling technique (Q1338135) (← links)
- A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods (Q1338143) (← links)
- Maximizing bilinear forms subject to linear constraints (Q1338503) (← links)
- A proximal point algorithm for minimax problems (Q1371666) (← links)
- (Q1406106) (redirect page) (← links)
- An algorithm for simplex tableau reduction: The push-to-pull solution strategy (Q1406107) (← links)
- Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization (Q1411546) (← links)
- A proportioning based algorithm with rate of convergence for bound constrained quadratic programming (Q1418846) (← links)
- Best ellipsoidal relaxation to solve a nonconvex problem. (Q1421225) (← links)
- On quasi-solution to infeasible linear complementarity problem obtained by Lemke's method (Q1422621) (← links)
- Linearization method of global optimization for generalized geometric programming (Q1763283) (← links)
- A finite improvement algorithm for the linear complementarity problem (Q1823161) (← links)
- A two-piece update of projected Hessian algorithm with nonmonotonic trust region method for constrained optimization (Q1888512) (← links)
- Uncertainty and method choice in discrete multiobjective programming problems (Q1892086) (← links)
- Linear programming: mathematics, theory and algorithms (Q1921384) (← links)
- An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints (Q1923627) (← links)
- On the \(E\)-epigraph of an \(E\)-convex function (Q2370042) (← links)
- Parametrized saddle points (Q2431303) (← links)
- (Q2806591) (← links)
- (Q2822899) (← links)
- (Q2883530) (← links)
- (Q2884175) (← links)
- (Q2884176) (← links)
- (Q2918735) (← links)
- (Q2996341) (← links)
- (Q3068723) (← links)
- (Q3204327) (← links)
- (Q3312032) (← links)
- (Q3344754) (← links)
- (Q3346105) (← links)
- (Q3351152) (← links)
- Concerning the intermediate point in the mean value theorem (Q3391546) (← links)
- Properties of the intermediate point from the Taylor's theorem (Q3405673) (← links)
- (Q3432579) (← links)
- (Q3453656) (← links)
- (Q3454294) (← links)
- (Q3470263) (← links)
