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 46 items.
- (Q4607765) (← links)
- $LDL^T$ Direction Interior Point Method for Semidefinite Programming (Q4609469) (← links)
- A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization (Q4622888) (← links)
- Sum-of-Squares Optimization without Semidefinite Programming (Q4629344) (← links)
- A long-step interior-point algorithm for symmetric cone Cartesian <i>P</i><sub>*</sub>(κ)-HLCP (Q4646542) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets (Q5043282) (← links)
- On the Computability of Continuous Maximum Entropy Distributions with Applications (Q5048289) (← links)
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization (Q5076724) (← links)
- Alfonso: Matlab Package for Nonsymmetric Conic Optimization (Q5084625) (← links)
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) (← links)
- Logarithmic-Barrier Decomposition Interior-Point Methods for Stochastic Linear Optimization in a Hilbert Space (Q5107285) (← links)
- Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation (Q5116548) (← links)
- Hardness Results for Structured Linear Systems (Q5117379) (← links)
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
- Stationary Distributions of Continuous-Time Markov Chains: A Review of Theory and Truncation-Based Approximations (Q5150207) (← links)
- Refining the partition for multifold conic optimization problems (Q5151515) (← links)
- A self-concordant exponential kernel function for primal–dual interior-point algorithm (Q5169467) (← links)
- A Single-Phase, Proximal Path-Following Framework (Q5219702) (← links)
- Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs (Q5243181) (← links)
- Diameter and Curvature: Intriguing Analogies (Q5301011) (← links)
- NEWTON FLOW AND INTERIOR POINT METHODS IN LINEAR PROGRAMMING (Q5318371) (← links)
- Approximate minimum enclosing balls in high dimensions using core-sets (Q5463443) (← links)
- Book Review: The basic George B. Dantzig (Q5494765) (← links)
- Exact Duality in Semidefinite Programming Based on Elementary Reformulations (Q5501234) (← links)
- Probabilistic analyses of condition numbers (Q5740078) (← links)
- Application of facial reduction to <i>H</i> <sub>∞</sub> state feedback control problem (Q5742517) (← links)
- Preprocessing and Regularization for Degenerate Semidefinite Programs (Q5746441) (← links)
- A new outlier detection method based on convex optimization: application to diagnosis of Parkinson’s disease (Q5861184) (← links)
- Estimation in the partially nonlinear model by continuous optimization (Q5861225) (← links)
- Projectively Self-Concordant Barriers (Q5868964) (← links)
- Tensors in computations (Q5887832) (← links)
- Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier (Q6038640) (← links)
- A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms (Q6041108) (← links)
- Linear optimization over homogeneous matrix cones (Q6047504) (← links)
- Rational dual certificates for weighted sums-of-squares polynomials with boundable bit size (Q6051120) (← links)
- A new perspective on low-rank optimization (Q6052053) (← links)
- A faster interior-point method for sum-of-squares optimization (Q6053475) (← links)
- Performance enhancements for a generic conic interior point algorithm (Q6102857) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
- Optimal step length for the maximal decrease of a self-concordant function by the Newton method (Q6124345) (← links)
- Convergence rate analysis of the multiplicative gradient method for PET-type problems (Q6161276) (← links)
- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation (Q6166934) (← links)
- Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty (Q6176403) (← links)
- (Q6191375) (← links)
- How Do Exponential Size Solutions Arise in Semidefinite Programming? (Q6195320) (← links)