The following pages link to (Q3141900):
Displaying 50 items.
- Accelerated training of max-margin Markov networks with kernels (Q391744) (← links)
- Asymptotics of the maximal radius of an \(L^{r}\)-optimal sequence of quantizers (Q408108) (← links)
- An efficient DC programming approach for portfolio decision with higher moments (Q409263) (← links)
- Numerical solution of an adhesion problem with FEM and BEM (Q413634) (← links)
- A robust Kantorovich's theorem on the inexact Newton method with relative residual error tolerance (Q423882) (← links)
- Image space analysis for variational inequalities with cone constraints and applications to traffic equilibria (Q424319) (← links)
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization (Q429459) (← links)
- Sample average approximation of stochastic dominance constrained programs (Q431031) (← links)
- Fixed point optimization algorithm and its application to power control in CDMA data networks (Q431032) (← links)
- \(L\)-invex-infine functions and applications (Q435079) (← links)
- Learning sparse gradients for variable selection and dimension reduction (Q439003) (← links)
- The space decomposition theory for a class of eigenvalue optimizations (Q457214) (← links)
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria (Q460659) (← links)
- Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995) (← links)
- Computing the nearest Euclidean distance matrix with low embedding dimensions (Q463737) (← links)
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function (Q467409) (← links)
- BCQ and strong BCQ for nonconvex generalized equations with applications to metric subregularity (Q475360) (← links)
- Regularizations for stochastic linear variational inequalities (Q481768) (← links)
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles (Q484139) (← links)
- A unified approach to convex and convexified generalized differentiation of nonsmooth functions and set-valued mappings (Q484483) (← links)
- Implicit yield function formulation for granular and rock-like materials (Q487834) (← links)
- Expanding the applicability of the Gauss-Newton method for convex optimization under a majorant condition (Q489972) (← links)
- A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
- A generalization of Löwner-John's ellipsoid theorem (Q494343) (← links)
- An exact cooperative method for the uncapacitated facility location problem (Q495932) (← links)
- Reverse propagation of McCormick relaxations (Q496587) (← links)
- Local convergence analysis of inexact Gauss-Newton method for singular systems of equations under majorant and center-majorant condition (Q497466) (← links)
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals (Q501263) (← links)
- Optimization tools for solving equilibrium problems with nonsmooth data (Q504804) (← links)
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods (Q507324) (← links)
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery (Q511961) (← links)
- Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) (← links)
- Global efficiency for multiobjective bilevel programming problems under generalized invexity (Q513525) (← links)
- Sufficient conditions to compute any solution of a quasivariational inequality via a variational inequality (Q522085) (← links)
- Inexact proximal Newton methods for self-concordant functions (Q522088) (← links)
- Differentiable McCormick relaxations (Q522264) (← links)
- Gap functions for quasi-equilibria (Q524911) (← links)
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems (Q526828) (← links)
- Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
- New results on \(k\)-independence of graphs (Q528993) (← links)
- On solving large-scale finite minimax problems using exponential smoothing (Q535071) (← links)
- Iterative algorithm for solving triple-hierarchical constrained optimization problem (Q535086) (← links)
- Affine processes on positive semidefinite matrices (Q535197) (← links)
- Team optimization problems with Lipschitz continuous strategies (Q537649) (← links)
- Codifferential method for minimizing nonsmooth DC functions (Q539496) (← links)
- On approximations with finite precision in bundle methods for nonsmooth optimization (Q597165) (← links)
- Uniform tree approximation by global optimization techniques (Q600944) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- A perturbation approach for an inverse quadratic programming problem (Q607673) (← links)
- On equivalent equilibrium problems (Q607882) (← links)
