Pages that link to "Item:Q301735"

The following pages link to Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735):

Displaying 22 items.

• Performance enhancements for a generic conic interior point algorithm (Q6102857) (← links)
• Fixed-order H-infinity controller design for port-Hamiltonian systems (Q6103002) (← links)
• A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems (Q6111345) (← links)
• New bounds for the empirical robust Kullback-Leibler divergence problem (Q6124700) (← links)
• Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization (Q6136653) (← links)
• Multi-task sparse identification for closed-loop systems with general observation sequences (Q6157363) (← links)
• Faster first-order primal-dual methods for linear programming using restarts and sharpness (Q6165583) (← links)
• Minimizing oracle-structured composite functions (Q6173766) (← links)
• Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming (Q6188510) (← links)
• Certifying optimality of Bell inequality violations: noncommutative polynomial optimization through semidefinite programming and local optimization (Q6490315) (← links)
• Semi-definite programming and quantum information (Q6561827) (← links)
• An efficient algorithm for optimal routing through constant function market makers (Q6573995) (← links)
• Path deformation method with constraints on normal curvature for wheeled robots in precision agriculture based on second-order cone programming (Q6581773) (← links)
• Quantile-constrained Wasserstein projections for robust interpretability of numerical and machine learning models (Q6595779) (← links)
• Estimation of the geometric measure of entanglement with Wehrl moments through artificial neural networks (Q6598114) (← links)
• Exploiting constant trace property in large-scale polynomial optimization (Q6599981) (← links)
• Remark on Algorithm 1012: computing projections with large datasets (Q6604165) (← links)
• Compositional synthesis for linear systems via convex optimization of assume-guarantee contracts (Q6605961) (← links)
• PEPIT: computer-assisted worst-case analyses of first-order optimization methods in python (Q6645946) (← links)
• Kullback-Leibler divergence based multidimensional robust universal hypothesis testing (Q6657830) (← links)
• An accelerated proximal alternating direction method of multipliers for optimal decentralized control of uncertain systems (Q6661698) (← links)
• Accelerated first-order methods for a class of semidefinite programs (Q6665390) (← links)