Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation
From MaRDI portal
Publication:2829585
DOI10.1080/10556788.2015.1121487zbMATH Open1386.90076OpenAlexW2185310671MaRDI QIDQ2829585FDOQ2829585
Yoshihiko Ito, Shunsuke Hayashi, Takayuki Okuno
Publication date: 8 November 2016
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2015.1121487
Linear programming (90C05) Interior-point methods (90C51) Extreme-point and pivoting methods (90C49)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Semidefinite Programming
- Applications of second-order cone programming
- Second-order cone programming
- Geometric fundamentals of the simplex method in semi-infinite programming
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- A New Exchange Method for Convex Semi-Infinite Programming
- On Linear Semi-Infinite Programming Problems: An Algorithm
- Optimal Magnetic Shield Design with Second-Order Cone Programming
- An Explicit Exchange Algorithm For Linear Semi-Infinite Programming Problems With Second-Order Cone Constraints
- A Regularized Explicit Exchange Method for Semi-Infinite Programs with an Infinite Number of Conic Constraints
- A pivoting procedure for a class of second-order cone programming
Cited In (11)
- A quadratically convergent sequential programming method for second-order cone programs capable of warm starts
- Extension of the LP-Newton method to conic programming problems via semi-infinite representation
- Primal Newton method for the linear cone programming problem
- On polyhedral and second-order cone decompositions of semidefinite optimization problems
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
- The Variant of Primal Simplex-Type Method for Linear Second-Order Cone Programming
- Recent contributions to linear semi-infinite optimization
- Two-phase simplex method for linear semidefinite optimization
- Three-dimensional plasticity-based topology optimization with smoothed finite element analysis
- Recent contributions to linear semi-infinite optimization: an update
- The dual simplex-type method for linear second-order cone programming problem
This page was built for publication: Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829585)
