The following pages link to Karel Zimmermann (Q300797):
Displaying 50 items.
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems (Q274096) (← links)
- On the lexicographic centre of multiple objective optimization (Q274101) (← links)
- Characterizations of improvement sets via quasi interior and applications in vector optimization (Q276329) (← links)
- Duality for max-separable problems (Q300798) (← links)
- Solving Malfatti's high dimensional problem by global optimization (Q317131) (← links)
- Normal subdifferentials of efficient point multifunctions in parametric vector optimization (Q360483) (← links)
- Differential properties of the symmetric matrix-valued Fischer-Burmeister function (Q430950) (← links)
- Fear of loss, inframodularity, and transfers (Q435911) (← links)
- A complete characterization of strong duality in nonconvex optimization with a single constraint (Q454276) (← links)
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
- On Lipschitz semicontinuity properties of variational systems with application to parametric optimization (Q467403) (← links)
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function (Q467409) (← links)
- Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces (Q467463) (← links)
- Optimal investment in heterogeneous capital and technology under restricted natural resource (Q467487) (← links)
- On a global optimization algorithm for bivariate smooth functions (Q481774) (← links)
- Greedy expansions in convex optimization (Q483395) (← links)
- Decision making and optimization. Special matrices and their applications in economics and management (Q485485) (← links)
- On a smooth dual gap function for a class of player convex generalized Nash equilibrium problems (Q493045) (← links)
- Second-order conditions for existence of augmented Lagrange multipliers for eigenvalue composite optimization problems (Q496593) (← links)
- The Delsarte extremal problem for the Jacobi transform (Q520578) (← links)
- Algorithms for approximating minimization problems in Hilbert spaces (Q534233) (← links)
- A hybrid trust region algorithm for unconstrained optimization (Q534267) (← links)
- Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems (Q550095) (← links)
- Scarcity, regulation and endogenous technical progress (Q553529) (← links)
- A direct active set algorithm for large sparse quadratic programs with simple bounds (Q583116) (← links)
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programs (Q583119) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
- Looking for the best constant in a Sobolev inequality: a numerical approach (Q607691) (← links)
- A predictor-corrector smoothing Newton method for symmetric cone complementarity problems (Q613219) (← links)
- Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town? (Q621921) (← links)
- A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions (Q627154) (← links)
- Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping (Q632862) (← links)
- Solving quadratic convex bilevel programming problems using a smoothing method (Q632921) (← links)
- \(n\)-step quadratic convergence of the MPRP method with a restart strategy (Q633952) (← links)
- A projected-gradient interior-point algorithm for complementarity problems (Q634730) (← links)
- Maximal monotone operators and the proximal point algorithm in the presence of computational errors (Q637560) (← links)
- Stopping rules and backward error analysis for bound-constrained optimization (Q639367) (← links)
- Possibility for decision. A possibilistic approach to real life decisions. (Q639422) (← links)
- On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space (Q643801) (← links)
- On nonconvex optimization (Q696127) (← links)
- Directional differentiability of the optimal value function in indefinite quadratic programming (Q696141) (← links)
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712) (← links)
- Fuzzy mathematical programming and fuzzy matrix games (Q705676) (← links)
- Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
- Moving object in \(\mathbb{R}^2\) and a group of observers (Q721511) (← links)
- On the convergence properties of Hildreth's quadratic programming algorithm (Q749443) (← links)
- On the numerical realization of the exact penalty method for quadratic programming algorithms (Q751516) (← links)
- Probabilistic sophistication without completeness (Q776961) (← links)
- Repeated delegation (Q785526) (← links)
