A Practical Interior-Point Method for Convex Programming
From MaRDI portal
Publication:4764313
Recommendations
Cited in
(19)- Interior-point methods for convex programming
- On some efficient interior point methods for nonlinear convex programming
- scientific article; zbMATH DE number 1047680 (Why is no real title available?)
- Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy
- On self-concordant convex–concave functions
- scientific article; zbMATH DE number 895357 (Why is no real title available?)
- Inner approximation method for a reverse convex programming problem
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization
- A circular cone relaxation primal interior point algorithm for LP
- A feasible BFGS interior point algorithm for solving convex minimization problems
- A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds
- An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
- Interior-point Lagrangian decomposition method for separable convex optimization
- Stable computation of interior point solutions for a class of nonlinear convex programming problems
- Some results of convex programming complexity
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- An interior point method for constrained saddle point problems
- An interior method for nonconvex semidefinite programs
- scientific article; zbMATH DE number 1889340 (Why is no real title available?)
This page was built for publication: A Practical Interior-Point Method for Convex Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764313)
