The following pages link to (Q2871233):
Displaying 50 items.
- Bilateral exchange and competitive equilibrium (Q255173) (← links)
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems (Q274096) (← links)
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces (Q288232) (← links)
- On a result of Pazy concerning the asymptotic behaviour of nonexpansive mappings (Q300577) (← links)
- A unified approach to convex and convexified generalized differentiation of nonsmooth functions and set-valued mappings (Q484483) (← links)
- Minsum location extended to gauges and to convex sets (Q495723) (← links)
- On a convex set with nondifferentiable metric projection (Q497462) (← links)
- Facility location in normed linear spaces (Q499693) (← links)
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals (Q501263) (← links)
- Variational geometric approach to generalized differential and conjugate calculi in convex analysis (Q683297) (← links)
- Quasi-relative interiors for graphs of convex set-valued mappings (Q828722) (← links)
- Characterizing robust local error bounds for linear inequality systems under data uncertainty (Q891541) (← links)
- Robust global error bounds for uncertain linear inequality systems with applications (Q905714) (← links)
- Subdifferential stability analysis for convex optimization problems via multiplier sets (Q1639960) (← links)
- Extremality of convex sets with some applications (Q1679618) (← links)
- Duality results for nonlinear single minimax location problems via multi-composed optimization (Q1683947) (← links)
- Convergent conic linear programming relaxations for cone convex polynomial programs (Q1728215) (← links)
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications (Q1740163) (← links)
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers (Q1756794) (← links)
- A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique (Q1756799) (← links)
- Semidefinite program duals for separable polynomial programs involving box constraints (Q1985290) (← links)
- A new notion of error bounds: necessary and sufficient conditions (Q1996751) (← links)
- A novel convex clustering method for high-dimensional data using semiproximal ADMM (Q2004149) (← links)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- Generalized Farkas lemma with adjustable variables and two-stage robust linear programs (Q2025291) (← links)
- Optimization of higher-order differential inclusions with special boundary value conditions (Q2073043) (← links)
- Retracted article: Hermite-Hadamard-type inequalities for \(\eta_h\)-convex functions via \(\psi\)-Riemann-Liouville fractional integrals (Q2125863) (← links)
- On some fractional integral inequalities for generalized strongly modified \(h\)-convex functions (Q2132228) (← links)
- Market equilibria and money (Q2138453) (← links)
- Second-order cone programming relaxations for a class of multiobjective convex polynomial problems (Q2150767) (← links)
- Approximations for Pareto and proper Pareto solutions and their KKT conditions (Q2168054) (← links)
- Closed convex sets with an open or closed Gauss range (Q2230947) (← links)
- A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints (Q2294373) (← links)
- Solving \(k\)-center problems involving sets based on optimization techniques (Q2301186) (← links)
- Directional Pareto efficiency: concepts and optimality conditions (Q2315267) (← links)
- Minimizing differences of convex functions with applications to facility location and clustering (Q2401517) (← links)
- On Douglas-Rachford operators that fail to be proximal mappings (Q2413080) (← links)
- A parameterized Douglas-Rachford algorithm (Q2419571) (← links)
- A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality (Q2423797) (← links)
- Differential stability of discrete optimal control problems with possibly nondifferentiable costs (Q2675241) (← links)
- Second order analysis for robust inclusion systems and applications (Q2679239) (← links)
- Book review of: B. S. Mordukhovich and N. M. Nam, Convex analysis and beyond. Volume I. Basic theory (Q2679248) (← links)
- A globally convergent proximal Newton-type method in nonsmooth convex optimization (Q2687066) (← links)
- On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty (Q2687494) (← links)
- Minimal time function with respect to a set of directions: basic properties and applications (Q2815545) (← links)
- On the convexity of piecewise-defined functions (Q2994670) (← links)
- Second-order viability problems for differential inclusions with endpoint constraint and duality (Q3389523) (← links)
- (Q4557933) (← links)
- Regularizing with Bregman--Moreau Envelopes (Q4561226) (← links)
- Clustering and multifacility location with constraints via distance function penalty methods and dc programming (Q4646536) (← links)
