A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
From MaRDI portal
Publication:4441953
DOI10.1137/S1052623401392123zbMath1075.90078OpenAlexW2130632243MaRDI QIDQ4441953
Craig T. Lawrence, André L. Tits, Andreas Wächter, Thomas J. Urban, Sasan Bakhtiari
Publication date: 19 January 2004
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623401392123
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items
Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming, An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization, A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm, An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization, Primal-dual interior-point method for an optimization problem related to the modeling of atmospheric organic aerosols, Modeling and inverse identification method for the characterization of elastic-plastic contact behavior during flat punch indentation, A note on the use of vector barrier parameters for interior-point methods, Learning to steer nonlinear interior-point methods, Primal-dual interior point QP-free algorithm for nonlinear constrained optimization, A feasible directions method for nonsmooth convex optimization, Newton-KKT interior-point methods for indefinite quadratic programming, An aggregate deformation homotopy method for min-max-min problems with max-min constraints, A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme, Limited memory interior point bundle method for large inequality constrained nonsmooth minimization, An improved feasible QP-free algorithm for inequality constrained optimization, Local analysis of the feasible primal-dual interior-point method, An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness, A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties, Allee optimal control of a system in ecology, Study of a primal-dual algorithm for equality constrained minimization, A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints, A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization, Optimization-based approach to path planning for closed chain robot systems, A unified Lagrangian formulation for solid and fluid dynamics and its possibility for modelling submarine landslides and their consequences, A local convergence property of primal-dual methods for nonlinear programming, Portfolio optimization with entropic value-at-risk, Globally convergent cutting plane method for nonconvex nonsmooth minimization, Primal-dual interior-point method for thermodynamic gas-particle partitioning, An interior-point piecewise linear penalty method for nonlinear programming, Newton-type methods: a broader view, On second-order optimality conditions for nonlinear programming, On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, An interior algorithm for nonlinear optimization that combines line search and trust region steps, Sequential systems of linear equations method for general constrained optimization without strict complementarity, Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties, A general class of penalty/barrier path-following Newton methods for nonlinear programming, Mathematical optimization problems for particle finite element analysis applied to 2D landslide modeling, A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization, Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC, Infeasible constraint-reduced interior-point methods for linear optimization, Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods, A global QP-free algorithm for mathematical programs with complementarity constraints, An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
Uses Software
