The following pages link to Foundations of Optimization (Q5503213):
Displaying 50 items.
- Stability and experimental comparison of prototypical iterative schemes for total variation regularized problems (Q302250) (← links)
- Barrier method in nonsmooth convex optimization without convex representation (Q497445) (← links)
- A cooperative conjugate gradient method for linear systems permitting efficient multi-thread implementation (Q725796) (← links)
- Descent: an optimization point of view on different fields (Q872231) (← links)
- Spatial implementation (Q894629) (← links)
- Two new splitting algorithms for equilibrium problems (Q1674104) (← links)
- Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver (Q1679488) (← links)
- Robust and Pareto optimality of insurance contracts (Q1683105) (← links)
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (Q1702782) (← links)
- Flexible linear mixed models with improper priors for longitudinal and survival data (Q1746532) (← links)
- Optimal design of uptime-guarantee contracts under IGFR valuations and convex costs (Q1752228) (← links)
- Existence of solutions for generalized vector quasi-equilibrium problems in abstract convex spaces with applications (Q2017691) (← links)
- Comments on: ``A note on the paper ``Optimality conditions for optimistic bilevel programming problem using convexifactors'' (Q2046548) (← links)
- A hybrid acceleration strategy for nonparallel support vector machine (Q2055553) (← links)
- Safe sample screening rules for multicategory angle-based support vector machines (Q2143029) (← links)
- Using geometric arithmetic mean to solve non-linear fractional programming problems (Q2170967) (← links)
- \(k\)-sets and rectilinear crossings in complete uniform hypergraphs (Q2173451) (← links)
- Deville and Särndal's calibration: revisiting a 25-years-old successful optimization problem (Q2177710) (← links)
- Scaling up twin support vector regression with safe screening rule (Q2200535) (← links)
- Discrete time optimal control with frequency constraints for non-smooth systems (Q2280876) (← links)
- Matrix forms of iterative algorithms to solve large-scale discrete ill-posed problems with an application to image restoration (Q2318302) (← links)
- A safe screening rule for accelerating weighted twin support vector machine (Q2318604) (← links)
- On cutting planes for cardinality-constrained linear programs (Q2330656) (← links)
- The structure of variational preferences (Q2347917) (← links)
- Stability analysis of Crank-Nicolson and Euler schemes for time-dependent diffusion equations (Q2350724) (← links)
- Hybrid genetic deflated Newton method for global optimisation (Q2359991) (← links)
- On the rectilinear crossing number of complete uniform hypergraphs (Q2362105) (← links)
- Linearly convergent away-step conditional gradient for non-strongly convex functions (Q2364483) (← links)
- On multiobjective bilevel optimization using tangential subdifferentials (Q2691426) (← links)
- Grundlagen der Mathematischen Optimierung (Q2778948) (← links)
- Introduction to optimization and semidifferential calculus. (Q2880314) (← links)
- Support and separation properties of convex sets in finite dimension (Q3390301) (← links)
- (Q3726857) (← links)
- Approximate Lagrangian duality and saddle point optimality in set optimization (Q4603941) (← links)
- (Q4811636) (← links)
- (Q4936321) (← links)
- A Data-Independent Distance to Infeasibility for Linear Conic Systems (Q4959838) (← links)
- On the minimax theorem for the space of probability measures on metric spaces (Q4989149) (← links)
- Generalized versions of reverse Young inequalities (Q5012115) (← links)
- Algorithms for Simple Bilevel Programming (Q5014631) (← links)
- Technical Note—Two-Stage Sample Robust Optimization (Q5031032) (← links)
- Sparsity constrained optimization problems via disjunctive programming (Q5039398) (← links)
- A proof of the Minkowski inequalities based on convex homogeneous functions (Q5048792) (← links)
- Refining the partition for multifold conic optimization problems (Q5151515) (← links)
- Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver (Q5198001) (← links)
- The Discrete-Time Geometric Maximum Principle (Q5232250) (← links)
- Codomain rigidity of the Dirichlet to Neumann operator for the Riemannian wave equation (Q5380513) (← links)
- Exact Duality in Semidefinite Programming Based on Elementary Reformulations (Q5501234) (← links)
- Spectral factorization using FFTs for large‐scale problems (Q5743808) (← links)
- On the identification of the optimal partition for semidefinite optimization (Q5882391) (← links)
