The following pages link to (Q4324980):
Displaying 50 items.
- Minimum eigenvalue inequalities for \(Z\)-transformations on proper and symmetric cones (Q1947108) (← links)
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (Q1947198) (← links)
- Self-concordant analysis for logistic regression (Q1952060) (← links)
- A globally convergent filter-type trust region method for semidefinite programming (Q1955230) (← links)
- Portfolio selection under model uncertainty: a penalized moment-based optimization approach (Q1955553) (← links)
- Optimal and robust waveform design for MIMO radars in the presence of clutter (Q1957223) (← links)
- Separable self-concordant spectral functions and a conjecture of Tunçel (Q1960190) (← links)
- General equilibrium models and homotopy methods (Q1960548) (← links)
- Approximating fixed points of weakly contracting mappings (Q1974567) (← links)
- Complexity analysis for certain convex programming problems (Q1974569) (← links)
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696) (← links)
- Numerical algebraic geometry and semidefinite programming (Q1979983) (← links)
- A novel upper bound finite-element for the limit analysis of plates and shells (Q1982372) (← links)
- Composite convex optimization with global and local inexact oracles (Q1986105) (← links)
- Second-order cone interior-point method for quasistatic and moderate dynamic cohesive fracture (Q1989097) (← links)
- An augmented Lagrangian method for the optimal \(H_\infty\) model order reduction problem (Q1993192) (← links)
- The tropical analogue of the Helton-Nie conjecture is true (Q1994125) (← links)
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming (Q1994127) (← links)
- Dual optimal design and the Christoffel-Darboux polynomial (Q1996729) (← links)
- The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints (Q1996996) (← links)
- Hyperbolic efficiency measurement: a conic programming approach (Q1999369) (← links)
- Finite Blaschke products with prescribed critical points, Stieltjes polynomials, and moment problems (Q1999819) (← links)
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming (Q1999885) (← links)
- Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics (Q2006121) (← links)
- Learning general sparse additive models from point queries in high dimensions (Q2007617) (← links)
- LMI and SDP technique for stability analysis of nonlinear delay systems subject to constraints (Q2010146) (← links)
- Solving nearly-separable quadratic optimization problems as nonsmooth equations (Q2013144) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- Gaddum's test for symmetric cones (Q2022297) (← links)
- The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability (Q2022366) (← links)
- An efficient parameterized logarithmic kernel function for semidefinite optimization (Q2023749) (← links)
- A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
- Covering problems with polyellipsoids: a location analysis perspective (Q2028797) (← links)
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
- A new measure of technical efficiency in data envelopment analysis based on the maximization of hypervolumes: benchmarking, properties and computational aspects (Q2030523) (← links)
- Performance indicators in multiobjective optimization (Q2030589) (← links)
- Russell graph efficiency measures in data envelopment analysis: the multiplicative approach (Q2030620) (← links)
- Optimal design for manipulation of random consensus over discrete information in networked systems (Q2030988) (← links)
- Noncommutative polynomials describing convex sets (Q2031064) (← links)
- In between the \(LQG/H_2\)- and \(H_{\infty } \)-control theories (Q2034820) (← links)
- Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities (Q2044573) (← links)
- Fitting tractable convex sets to support function evaluations (Q2046436) (← links)
- An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood (Q2048820) (← links)
- Nonhomogeneous Karcher equations with vector fields on positive definite matrices (Q2049072) (← links)
- A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization (Q2050559) (← links)
- A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function (Q2053077) (← links)
- A two-step improved Newton method to solve convex unconstrained optimization problems (Q2053267) (← links)
- A distributed algorithm for high-dimension convex quadratically constrained quadratic programs (Q2057223) (← links)
- Optimal step length for the Newton method: case of self-concordant functions (Q2067259) (← links)
- Newton polytopes and relative entropy optimization (Q2067684) (← links)
