Pages that link to "Item:Q1572675"
From MaRDI portal
The following pages link to Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems (Q1572675):
Displaying 36 items.
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- The practical behavior of the homogeneous self-dual formulations in interior point methods (Q302143) (← links)
- Barrier subgradient method (Q633113) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Space tensor conic programming (Q742309) (← links)
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs (Q781112) (← links)
- A primal-dual symmetric relaxation for homogeneous conic systems (Q883335) (← links)
- Some convex programs without a duality gap (Q959958) (← links)
- Projective re-normalization for improving the behavior of a homogeneous conic linear system (Q1016122) (← links)
- Primal central paths and Riemannian distances for convex sets (Q1029546) (← links)
- Interior-point methods: An old and new approach to nonlinear programming (Q1365059) (← links)
- ``Cone-free'' primal-dual path-following and potential-reduction polynomial time interior-point methods (Q1771312) (← links)
- An infeasibility certificate for nonlinear programming based on Pareto criticality condition (Q1790183) (← links)
- Numerical algebraic geometry and semidefinite programming (Q1979983) (← links)
- An interior point-proximal method of multipliers for convex quadratic programming (Q2028483) (← links)
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization (Q2149553) (← links)
- Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
- Douglas-Rachford splitting and ADMM for pathological convex optimization (Q2282817) (← links)
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs (Q2316619) (← links)
- A complementarity partition theorem for multifold conic systems (Q2434990) (← links)
- Dual versus primal-dual interior-point methods for linear and conic programming (Q2467157) (← links)
- Embedding methods for semidefinite programming (Q2885491) (← links)
- An interior point method for nonlinear programming with infeasibility detection capabilities (Q2926056) (← links)
- Interior-point methods for optimization (Q3612043) (← links)
- Facial Reduction and Partial Polyhedrality (Q4586172) (← links)
- Sum-of-Squares Optimization without Semidefinite Programming (Q4629344) (← links)
- Solving SDP completely with an interior point oracle (Q4999336) (← links)
- An algorithm for nonsymmetric conic optimization inspired by MOSEK (Q5043851) (← links)
- Solving Natural Conic Formulations with Hypatia.jl (Q5058009) (← links)
- Primal-Dual Interior-Point Methods for Domain-Driven Formulations (Q5119848) (← links)
- Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP (Q5242927) (← links)
- Hessian distances and their applications in the complexity analysis of interior-point methods (Q5299911) (← links)
- Preprocessing and Regularization for Degenerate Semidefinite Programs (Q5746441) (← links)
- Error Bounds and Singularity Degree in Semidefinite Programming (Q5857289) (← links)
- Performance enhancements for a generic conic interior point algorithm (Q6102857) (← links)
- Computing conjugate barrier information for nonsymmetric cones (Q6596336) (← links)
