Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
From MaRDI portal
Recommendations
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- scientific article; zbMATH DE number 778139
- Detecting infeasibility in infeasible-interior-point methods for optimization
- Infeasibility Detection and SQP Methods for Nonlinear Optimization
- An interior point method for nonlinear programming with infeasibility detection capabilities
Cited in
(40)- Projective re-normalization for improving the behavior of a homogeneous conic linear system
- Primal central paths and Riemannian distances for convex sets
- Interior-point methods: An old and new approach to nonlinear programming
- ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods
- An infeasibility certificate for nonlinear programming based on Pareto criticality condition
- Numerical algebraic geometry and semidefinite programming
- An interior point-proximal method of multipliers for convex quadratic programming
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
- Status determination by interior-point methods for convex optimization problems in domain-driven form
- Douglas-Rachford splitting and ADMM for pathological convex optimization
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
- A complementarity partition theorem for multifold conic systems
- Dual versus primal-dual interior-point methods for linear and conic programming
- Embedding methods for semidefinite programming
- An interior point method for nonlinear programming with infeasibility detection capabilities
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
- The practical behavior of the homogeneous self-dual formulations in interior point methods
- Feasible distance in non-conic convex optimization problems
- Interior-point methods for optimization
- Facial reduction and partial polyhedrality
- Sum-of-squares optimization without semidefinite programming
- Solving SDP completely with an interior point oracle
- An algorithm for nonsymmetric conic optimization inspired by MOSEK
- Solving Natural Conic Formulations with Hypatia.jl
- Primal-dual interior-point methods for domain-driven formulations
- Strict complementarity in semidefinite optimization with elliptopes including the maxcut SDP
- Hessian distances and their applications in the complexity analysis of interior-point methods
- Detecting infeasibility in infeasible-interior-point methods for optimization
- Preprocessing and regularization for degenerate semidefinite programs
- Error bounds and singularity degree in semidefinite programming
- Performance enhancements for a generic conic interior point algorithm
- Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming
- Barrier subgradient method
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Computing conjugate barrier information for nonsymmetric cones
- Interior-point algorithms with full Newton steps for nonsymmetric convex conic optimization
- Space tensor conic programming
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- A primal-dual symmetric relaxation for homogeneous conic systems
- Some convex programs without a duality gap
This page was built for publication: Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1572675)
