Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
From MaRDI portal
Publication:4210186
DOI10.1137/S036012995279031zbMath0921.90137OpenAlexW2015530812WikidataQ58048142 ScholiaQ58048142MaRDI QIDQ4210186
Matthias Heinkenschloss, John E. jun. Dennis, Luis Nunes Vicente
Publication date: 21 September 1998
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s036012995279031
interior-point algorithmsnonlinear programmingSQP methodsoptimal control problemstrust-region methodssimple boundsColeman-Li affine scalingDikin-Karmarkar ellipsoid
Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
A two-stage active-set algorithm for bound-constrained optimization, Synthesizing invariant barrier certificates via difference-of-convex programming, Second-order negative-curvature methods for box-constrained and general constrained optimization, An augmented Lagrangian affine scaling method for nonlinear programming, A trust region method for solving the decentralized static output feedback design problem, An active set algorithm for nonlinear optimization with polyhedral constraints, An optimal control problem for flows with discontinuities, Updating the multipliers associated with inequality constraints in an augmented Lagrangian multiplier method, An active set feasible method for large-scale minimization problems with bound constraints, A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory, Optimization of a continuous distillation process under random inflow rate., A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties, A null space method for solving system of equations., Penalty-free method for nonsmooth constrained optimization via radial basis functions, A trust region interior point algorithm for infinite dimensional nonlinear programming, The penalty interior-point method fails to converge, Penalized interior point approach for constrained nonlinear programming, Solving nonlinear programming problems with noisy function values and noisy gradients, Unnamed Item, A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization, Local convergence of the interior-point Newton method for general nonlinear programming, A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization, Reduced order output feedback control design for PDE systems using proper orthogonal decomposition and nonlinear semidefinite programming, Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties, A feasible interior-point algorithm for nonconvex nonlinear programming, Optimal control problems for the two dimensional Rayleigh-Bénard type convection by a gradient method, Examples of ill-behaved central paths in convex optimization, A penalty method for PDE-constrained optimization in inverse problems, Solving discretized degenerate optimal control problems with state constraints, Global convergence of trust region algorithm for equality and bound constrained nonlinear optimization, TRICE, Matrix-free algorithm for the large-scale constrained trust-region subproblem, Trust region methods for solving the optimal output feedback design problem, Optimal control, Local analysis of a new multipliers method, An inexact ℓ1penalty SQP algorithm for PDE-constrained optimization with an application to shape optimization in linear elasticity, Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming
Uses Software
