The following pages link to (Q4821526):
Displaying 50 items.
- Closures of quadratic modules (Q636039) (← links)
- Quantifying entanglement of two relativistic particles using optimal entanglement witness (Q638585) (← links)
- The solution path of the generalized lasso (Q638794) (← links)
- A Bayesian approach for inferring neuronal connectivity from calcium fluorescent imaging data (Q641075) (← links)
- An auto-generated real-time iteration algorithm for nonlinear MPC in the microsecond range (Q642642) (← links)
- A parameterization of parahermitian matrix functions and its application to a state-space solution for \(\mu\)-analysis (Q643681) (← links)
- A convex optimization approach to robust iterative learning control for linear systems with time-varying parametric uncertainties (Q644271) (← links)
- Convexity and convex approximations of discrete-time stochastic control problems with constraints (Q644284) (← links)
- Stability and convergence in discrete convex monotone dynamical systems (Q644440) (← links)
- On convex optimization without convex representation (Q644504) (← links)
- Complete characterization and synthesis of the response function of elastodynamic networks (Q644710) (← links)
- Convex hulls of curves of genus one (Q645211) (← links)
- A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation (Q645558) (← links)
- Conditions under which suboptimal nonlinear MPC is inherently robust (Q645583) (← links)
- Fundamental connections among the stability conditions using higher-order time-derivatives of Lyapunov functions for the case of linear time-invariant systems (Q645589) (← links)
- Multi-task clustering via domain adaptation (Q645880) (← links)
- Robust net present value (Q646075) (← links)
- Efficient stockpiling and shipping policies for humanitarian relief: UNHCR's inventory challenge (Q647504) (← links)
- Measuring and repairing inconsistency in probabilistic knowledge bases (Q648360) (← links)
- Probabilistic eigenvalue buckling analysis solved through the ratio of polynomial response surface (Q649254) (← links)
- Solving optimization problems on ranks and inertias of some constrained nonlinear matrix functions via an algebraic linearization method (Q651143) (← links)
- Modeling item-item similarities for personalized recommendations on Yahoo! front page (Q652346) (← links)
- Zhang neural network for online solution of time-varying convex quadratic program subject to time-varying linear-equality constraints (Q653080) (← links)
- The optimal value and optimal solutions of the proximal average of convex functions (Q654069) (← links)
- Modern tools for the time-discrete dynamics and optimization of gene-environment networks (Q654347) (← links)
- A dynamical model for solving degenerate quadratic minimax problems with constraints (Q654740) (← links)
- On the relation between the linear factor model and the latent profile model (Q658136) (← links)
- Message-passing algorithms for inference and optimization (Q658470) (← links)
- Robust duality for fractional programming problems with constraint-wise data uncertainty (Q658562) (← links)
- Enforcement of constraints and maximum principles in the variational multiscale method (Q658707) (← links)
- Load capacity ratios for structures (Q658709) (← links)
- Dependence structure of risk factors and diversification effects (Q659262) (← links)
- Metric uniformization and spectral bounds for graphs (Q659931) (← links)
- Confidence structural robust design and optimization under stiffness and load uncertainties (Q660389) (← links)
- First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials (Q662299) (← links)
- Decentralized algorithm for centralized variational inequalities in network resource allocation (Q662849) (← links)
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs (Q662860) (← links)
- Split Bregman method for minimization of improved active contour model combining local and global information dynamically (Q663708) (← links)
- Inferring stable genetic networks from steady-state data (Q665132) (← links)
- Fast computation of minimal elementary decompositions of metabolic flux vectors (Q665165) (← links)
- A branch-and-cut algorithm for a class of sum-of-ratios problems (Q668157) (← links)
- Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning (Q669277) (← links)
- Improved linear embeddings via Lagrange duality (Q669310) (← links)
- Practical covert quantum key distribution with decoy-state method (Q670022) (← links)
- An analysis of discontinuous Galerkin methods for the compressible Euler equations: entropy and \(L_2\) stability (Q670310) (← links)
- Design and analysis of two discrete-time ZD algorithms for time-varying nonlinear minimization (Q679697) (← links)
- Improved algorithm for computing the domain of attraction of rational nonlinear systems (Q681144) (← links)
- Network expansion to mitigate market power (Q681461) (← links)
- Data-driven inverse optimization with imperfect information (Q681497) (← links)
- Exploiting damped techniques for nonlinear conjugate gradient methods (Q684134) (← links)
