The following pages link to (Q4324980):
Displaying 50 items.
- Bregman primal-dual first-order method and application to sparse semidefinite programming (Q2070334) (← links)
- Mixed-sensitivity \(\mathcal{L}_2\) controller synthesis for discrete-time LPV/LFR systems (Q2071181) (← links)
- Convex optimization with an interpolation-based projection and its application to deep learning (Q2071365) (← links)
- An interior point-proximal method of multipliers for linear positive semi-definite programming (Q2073047) (← links)
- Complexity aspects of local minima and related notions (Q2074805) (← links)
- An elliptical cover problem in drone delivery network design and its solution algorithms (Q2079395) (← links)
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space (Q2079694) (← links)
- Revitalizing the multivariate elliptical leptokurtic-normal distribution and its application in model-based clustering (Q2081762) (← links)
- The traveling \(k\)-median problem: approximating optimal network coverage (Q2085738) (← links)
- Curiosities and counterexamples in smooth convex optimization (Q2089782) (← links)
- Second-order cone and semidefinite methods for the bisymmetric matrix approximation problem (Q2091722) (← links)
- Dynamic state feedback controller and observer design for dynamic artificial neural network models (Q2097779) (← links)
- On Newton's method for solving generalized equations (Q2099273) (← links)
- LASSO for streaming data with adaptative filtering (Q2104007) (← links)
- Realizations of non-commutative rational functions around a matrix centre. II: The lost-abbey conditions (Q2108019) (← links)
- Swarm formation for perimeter surveillance in rectangular strips: a distributed model predictive approach (Q2109167) (← links)
- Point-sampled-data passivity stabilization of stochastic complex-valued memristor networks with multi-delays and reaction-diffusion term: a switching model approach (Q2109205) (← links)
- Tight bounds for a class of data-driven distributionally robust risk measures (Q2115129) (← links)
- On self-concordant barriers for generalized power cones (Q2115322) (← links)
- Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations (Q2116587) (← links)
- A new interface capturing method for Allen-Cahn type equations based on a flow dynamic approach in Lagrangian coordinates. I: One-dimensional case (Q2125413) (← links)
- Local convergence of tensor methods (Q2133417) (← links)
- Rank computation in Euclidean Jordan algebras (Q2133925) (← links)
- On semilocal convergence analysis for two-step Newton method under generalized Lipschitz conditions in Banach spaces (Q2138397) (← links)
- A Newton Frank-Wolfe method for constrained self-concordant minimization (Q2141726) (← links)
- A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization (Q2142525) (← links)
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization (Q2149553) (← links)
- Iteratively reweighted least squares and slime mold dynamics: connection and convergence (Q2149565) (← links)
- Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
- DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
- Proportional-integral projected gradient method for conic optimization (Q2151872) (← links)
- Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives (Q2156386) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
- A regularity result for shortest generalized billiard trajectories in convex bodies in \(\mathbb{R}^n\) (Q2164371) (← links)
- Comment on: ``Approximation algorithms for quadratic programming'' (Q2165269) (← links)
- Decentralized proximal splitting algorithms for composite constrained convex optimization (Q2170762) (← links)
- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming (Q2174912) (← links)
- Smoothness parameter of power of Euclidean norm (Q2178876) (← links)
- Distributed set-membership filtering for time-varying systems under constrained measurements and replay attacks (Q2181388) (← links)
- Dimension reduction for semidefinite programs via Jordan algebras (Q2188241) (← links)
- An inexact interior-point Lagrangian decomposition algorithm with inexact oracles (Q2188950) (← links)
- The multiproximal linearization method for convex composite problems (Q2191762) (← links)
- Contrast invariant SNR and isotonic regressions (Q2193820) (← links)
- On pricing approximate queries (Q2195392) (← links)
- A corrector-predictor interior-point method with new search direction for linear optimization (Q2201317) (← links)
- A filter-type method for solving nonlinear semidefinite programming (Q2202443) (← links)
- Efficient algorithms for solving the \(p\)-Laplacian in polynomial time (Q2209522) (← links)
- Numerical methods for porous medium equation by an energetic variational approach (Q2214663) (← links)
- Reconstruction and interpolation of manifolds. I: The geometric Whitney problem (Q2216248) (← links)
