Pages that link to "Item:Q1769069"
From MaRDI portal
The following pages link to A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization (Q1769069):
Displaying 29 items.
- An interior-point trust-funnel algorithm for nonlinear optimization (Q507313) (← links)
- Primal-dual interior-point method for thermodynamic gas-particle partitioning (Q538298) (← links)
- Local convergence of a relaxed two-step Newton like method with applications (Q683877) (← links)
- A primal-dual interior point method for nonlinear semidefinite programming (Q715092) (← links)
- Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming (Q732237) (← links)
- Parameter range reduction for ODE models using cumulative backward differentiation formulas (Q875157) (← links)
- A local convergence property of primal-dual methods for nonlinear programming (Q948957) (← links)
- Superlinearly convergent affine scaling interior trust-region method for linear constrained \(LC^{1}\) minimization (Q960640) (← links)
- An interior point method for nonlinear optimization with a quasi-tangential subproblem (Q1689438) (← links)
- Global convergence enhancement of classical linesearch interior point methods for MCPs (Q1861321) (← links)
- A primal-dual trust region algorithm for nonlinear optimization (Q1890304) (← links)
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties (Q1960196) (← links)
- Portfolio optimization with entropic value-at-risk (Q2001477) (← links)
- Curve approximation by \(G^1\) arc splines with a limited number of types of curvature and length (Q2243188) (← links)
- An adaptively regularized sequential quadratic programming method for equality constrained optimization (Q2244236) (← links)
- Recent advances in trust region algorithms (Q2349124) (← links)
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming (Q2490321) (← links)
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties (Q2494514) (← links)
- On a two-step relaxed Newton-type method (Q2513564) (← links)
- Globally and superlinearly convergent trust-region algorithm for convex \(SC^ 1\)-minimization problems and its application to stochastic programs (Q2565034) (← links)
- A primal-dual interior point method for nonlinear optimization: Global convergence, convergence rate and numerical performance for large scale problems (Q2722337) (← links)
- A Globally and Superlinearly Convergent Primal-dual Interior Point Method for General Constrained Optimization (Q2991816) (← links)
- Penalized interior point approach for constrained nonlinear programming (Q3572651) (← links)
- A globally convergent primal-dual interior point method for constrained optimization (Q4946718) (← links)
- A primal-dual interior point trust-region method for nonlinear semidefinite programming (Q4999340) (← links)
- A central path interior point method for nonlinear programming and its local convergence (Q5028593) (← links)
- A globally convergent regularized interior point method for constrained optimization (Q5058383) (← links)
- Trust-region interior-point method for large sparse<i>l</i><sub>1</sub>optimization (Q5437524) (← links)
- On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods (Q5880389) (← links)