Pages that link to "Item:Q1411642"
From MaRDI portal
The following pages link to Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming (Q1411642):
Displayed 18 items.
- A practical nonlinear dynamic framework for solving a class of fractional programming problems (Q330727) (← links)
- An algorithm for approximate multiparametric convex programming (Q853676) (← links)
- A globally convergent non-interior point algorithm with full Newton step for second-order cone programming (Q993313) (← links)
- A novel gradient-based neural network for solving convex second-order cone constrained variational inequality problems (Q1631447) (← links)
- A new neural network model for solving random interval linear programming problems (Q2181038) (← links)
- A \({\mathcal {VU}}\)-decomposition method for a second-order cone programming problem (Q2269047) (← links)
- Operational decisions for multi-period industrial gas pipeline networks under uncertainty (Q2331366) (← links)
- A Newton's method for perturbed second-order cone programs (Q2385540) (← links)
- On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
- Cuts for mixed 0-1 conic programming (Q2571004) (← links)
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem (Q2576724) (← links)
- The State-of-the-Art in Conic Optimization Software (Q2802542) (← links)
- Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming (Q2897298) (← links)
- $LDL^T$ Direction Interior Point Method for Semidefinite Programming (Q4609469) (← links)
- Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization (Q5172959) (← links)
- A feasible direction algorithm for nonlinear second-order cone programs (Q5238072) (← links)
- On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming (Q6098236) (← links)
- Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods (Q6120850) (← links)