Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming
From MaRDI portal
Publication:1411642
Recommendations
- Solving a class of semidefinite programs via nonlinear programming
- Semidefinite Programming
- An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
- An exact penalty method for nonconvex problems covering, in particular, nonlinear programming, semidefinite programming, and second-order cone programming
- Interior-point algorithms for semidefinite programming based on a nonlinear formulation
Cited in
(28)- A novel gradient-based neural network for solving convex second-order cone constrained variational inequality problems
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
- A new neural network model for solving random interval linear programming problems
- Using interior point solvers for optimizing progressive lens models with spherical coordinates
- A \({\mathcal {VU}}\)-decomposition method for a second-order cone programming problem
- Operational decisions for multi-period industrial gas pipeline networks under uncertainty
- A Newton's method for perturbed second-order cone programs
- On extracting maximum stable sets in perfect graphs using Lovász's theta function
- Cuts for mixed 0-1 conic programming
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- The state-of-the-art in conic optimization software
- An interior point constraint generation algorithm for semi-infinite optimization with health-care application
- Using interior-point methods within an outer approximation framework for mixed integer nonlinear programming
- A practical nonlinear dynamic framework for solving a class of fractional programming problems
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- \(LDL^T\) direction interior point method for semidefinite programming
- Smoothing and regularization for mixed-integer second-order cone programming with applications in portfolio optimization
- A feasible direction algorithm for nonlinear second-order cone programs
- On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming
- Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- A Huff-like location model with quality adjustment and/or closing of existing facilities
- Second-order cone programming for frictional contact mechanics using interior point algorithm
- A hybrid branch-and-bound and interior-point algorithm for stochastic mixed-integer nonlinear second-order cone programming
- A projection recurrent neural network method for solving absolute value equations associated with second-order cones
- An algorithm for approximate multiparametric convex programming
- A boundary point method to solve semidefinite programs
- A globally convergent non-interior point algorithm with full Newton step for second-order cone programming
This page was built for publication: Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1411642)
