Pages that link to "Item:Q2756074"
From MaRDI portal
The following pages link to A Mathematical View of Interior-Point Methods in Convex Optimization (Q2756074):
Displayed 50 items.
- On the complexity of the primal self-concordant barrier method. (Q1412708) (← links)
- Improved approximation results on standard quartic polynomial optimization (Q1686564) (← links)
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (Q1702782) (← links)
- Optimization approaches to quadrature: new characterizations of Gaussian quadrature on the line and quadrature with few nodes on plane algebraic curves, on the plane and in higher dimensions (Q1704603) (← links)
- Learning semidefinite regularizers (Q1740575) (← links)
- The mixing time of the Dikin walk in a polytope -- a simple proof (Q1755831) (← links)
- The Kantorovich theorem and interior point methods (Q1769068) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- Discretization method for semi-definite programming (Q1770709) (← links)
- Improving complexity of structured convex optimization problems using self-concordant barriers (Q1848383) (← links)
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization (Q1926632) (← links)
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems (Q1926650) (← links)
- Separable self-concordant spectral functions and a conjecture of Tunçel (Q1960190) (← links)
- Finite Blaschke products with prescribed critical points, Stieltjes polynomials, and moment problems (Q1999819) (← links)
- A new algorithm for concave quadratic programming (Q2010088) (← links)
- Optimal step length for the Newton method: case of self-concordant functions (Q2067259) (← links)
- Strong duality for standard convex programs (Q2074838) (← links)
- Cubic regularized Newton method for the saddle point models: a global and local convergence analysis (Q2148117) (← links)
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function (Q2245692) (← links)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (Q2393650) (← links)
- Antenna array synthesis with clusters of unmanned aerial vehicles (Q2440789) (← links)
- An entire space polynomial-time algorithm for linear programming (Q2442633) (← links)
- Multirate multicast service provisioning. II: A tâtonnement process for rate allocation (Q2460034) (← links)
- The convergence of an interior point method for an elliptic control problem with mixed control-state constraints (Q2479834) (← links)
- Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms (Q2482686) (← links)
- Tractable approximations to robust conic optimization problems (Q2492681) (← links)
- A numerical procedure for inferring from experimental data the optimization cost functions using a multibody model of the neuro-musculoskeletal system (Q2505461) (← links)
- Intrinsic volumes of symmetric cones and applications in convex programming (Q2515035) (← links)
- Extremum-seeking control of state-constrained nonlinear systems (Q2576111) (← links)
- Lexicographic differentiation of nonsmooth functions (Q2576740) (← links)
- Terracini convexity (Q2687050) (← links)
- A simplified treatment of Ramana's exact dual for semidefinite programming (Q2688906) (← links)
- New bounds for nonconvex quadratically constrained quadratic programming (Q2689857) (← links)
- Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods (Q2693782) (← links)
- Convergence of a weighted barrier algorithm for stochastic convex quadratic semidefinite optimization (Q2696952) (← links)
- Exponential varieties (Q2795901) (← links)
- Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects (Q2802530) (← links)
- On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming (Q2821802) (← links)
- Low-Rank Approximation and Completion of Positive Tensors (Q2827064) (← links)
- Bearing capacity of shallow foundations in transversely isotropic granular media (Q2854875) (← links)
- A Self-Concordant Interior Point Approach for Optimal Control with State Constraints (Q2954395) (← links)
- Bad Semidefinite Programs: They All Look the Same (Q2967605) (← links)
- Trajectory Optimization Strategies for Supercavitating Underwater Vehicles (Q3110973) (← links)
- Extreme points of well-posed polytopes (Q3446581) (← links)
- A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities (Q3449570) (← links)
- Several Jordan-algebraic aspects of optimization† (Q3507703) (← links)
- An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints (Q3539793) (← links)
- Interior-point methods for optimization (Q3612043) (← links)