The following pages link to (Q3837875):
Displaying 34 items.
- An interior-point piecewise linear penalty method for nonlinear programming (Q543401) (← links)
- Local path-following property of inexact interior methods in nonlinear programming (Q694602) (← links)
- Local convergence of the interior-point Newton method for general nonlinear programming (Q704733) (← links)
- Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming (Q732237) (← links)
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs (Q781112) (← links)
- Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems (Q812412) (← links)
- A local convergence property of primal-dual methods for nonlinear programming (Q948957) (← links)
- A filter interior-point algorithm with projected Hessian updating for nonlinear optimization (Q1032531) (← links)
- Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing (Q1424286) (← links)
- Local convergence of the affine-scaling interior-point algorithm for nonlinear programming (Q1588839) (← links)
- Optimal mechanism design using interior-point methods (Q1602056) (← links)
- An interior point method for nonlinear optimization with a quasi-tangential subproblem (Q1689438) (← links)
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization (Q1769069) (← links)
- Local convergence of a primal-dual method for degenerate nonlinear programming (Q1812091) (← links)
- On the formulation and theory of the Newton interior-point method for nonlinear programming (Q1918017) (← links)
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties (Q1960196) (← links)
- Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization (Q2028460) (← links)
- Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC (Q2032022) (← links)
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs (Q2105288) (← links)
- Multiway \(p\)-spectral graph cuts on Grassmann manifolds (Q2127266) (← links)
- Learning to steer nonlinear interior-point methods (Q2175369) (← links)
- Local analysis of the feasible primal-dual interior-point method (Q2427394) (← links)
- Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming (Q2429462) (← 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)
- Filling holes under non-linear constraints (Q2695658) (← links)
- Superlinear convergence of primal-dual interior point algorithms for nonlinear programming (Q2719236) (← links)
- Global convergence of a primal-dual interior-point method for nonlinear programming (Q2867318) (← links)
- From global to local convergence of interior methods for nonlinear optimization (Q2867424) (← links)
- Structure-Exploiting Interior Point Methods (Q3300491) (← 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)
- Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods (Q6120850) (← links)
- A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming (Q6166646) (← links)
