The following pages link to (Q3141900):
Displayed 50 items.
- A phase transition behavior for Brownian motions interacting through their ranks (Q2380764) (← links)
- Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem (Q2383649) (← links)
- Piecewise linear approximations in nonconvex nonsmooth optimization (Q2391130) (← links)
- Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems (Q2392776) (← links)
- Lipschitz behavior of solutions to nonconvex semi-infinite vector optimization problems (Q2392783) (← links)
- An extension of the basic constraint qualification to nonconvex vector optimization problems (Q2393089) (← links)
- Robust semi-local convergence analysis for inexact Newton method (Q2396513) (← links)
- A comparison of four approaches from stochastic programming for large-scale unit-commitment (Q2397759) (← links)
- A space decomposition scheme for maximum eigenvalue functions and its applications (Q2407989) (← links)
- Optimality conditions in optimization problems with convex feasible set using convexificators (Q2408896) (← links)
- The degrees of freedom of partly smooth regularizers (Q2409395) (← links)
- Global optimality conditions in nonconvex optimization (Q2412831) (← links)
- Rate of convergence of the bundle method (Q2412838) (← links)
- Algorithmic construction of the subdifferential from directional derivatives (Q2413566) (← links)
- Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
- Is pessimistic bilevel programming a special case of a mathematical program with complementarity constraints? (Q2420795) (← links)
- Global optimality conditions and exact penalization (Q2421449) (← links)
- Optimal stopping via pathwise dual empirical maximisation (Q2422357) (← links)
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization (Q2422878) (← links)
- A unified minimal solution in set optimization (Q2423801) (← links)
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
- Constrained iterations for blind deconvolution and convexity issues (Q2432708) (← links)
- The joint replenishment problem with variable production costs (Q2432876) (← links)
- A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems (Q2435021) (← links)
- Global optimality conditions for optimal control problems with functions of A.D. Alexandrov (Q2435024) (← links)
- Factorization and cutting planes for completely positive matrices by copositive projection (Q2436642) (← links)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
- The first variation of the total mass of log-concave functions and related inequalities (Q2437426) (← links)
- Global optimization of bounded factorable functions with discontinuities (Q2442640) (← links)
- Optimal learning with \textit{Q}-aggregation (Q2448729) (← links)
- Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions (Q2450909) (← links)
- A spatially continuous max-flow and min-cut framework for binary labeling problems (Q2454034) (← links)
- Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets (Q2456634) (← links)
- A general approach for studying duality in multiobjective optimization (Q2460035) (← links)
- Approximations of Lovász extensions and their induced interaction index (Q2462347) (← links)
- Abstract convexity, global optimization and data classification. (Q2467820) (← links)
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints (Q2471081) (← links)
- Accelerated IMRT plan optimization using the adaptive clustering method (Q2472376) (← links)
- Some assignment problems arising from multiple target tracking (Q2473184) (← links)
- On strong and total Lagrange duality for convex optimization problems (Q2473844) (← links)
- A polynomial time algorithm for Zero-Clairvoyant scheduling (Q2475435) (← links)
- Convex \(\mathrm{SO}(N) \times \mathrm{SO}(n)\)-invariant functions and refinements of von Neumann's inequality (Q2475502) (← links)
- A sensitivity analysis of a class of semi-coercive variational inequalities using recession tools (Q2481101) (← links)
- A dual view of equilibrium problems (Q2481820) (← links)
- Recursive approximation of the high dimensional max function (Q2488194) (← links)
- The strong conical hull intersection property for convex programming (Q2490330) (← links)
- Representative of quasidifferentials and its formula for a quasidifferentiable function (Q2490472) (← links)
- Lagrangian smoothing heuristics for Max-cut (Q2491324) (← links)
- On convergence of closed convex sets (Q2491680) (← links)
- Mathematical programming models and algorithms for engineering design optimization (Q2495616) (← links)