Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
From MaRDI portal
Publication:1856370
DOI10.1023/A:1020533003783zbMath1022.90017OpenAlexW1875551406MaRDI QIDQ1856370
David F. Shanno, Robert J. Vanderbei, Hande Y. Benson
Publication date: 10 April 2003
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1020533003783
Related Items
Effective reformulations of the truss topology design problem, Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming, Interior-point algorithms, penalty methods and equilibrium problems, A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm, Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling, Imposing maximum length scale in topology optimization, A robust and informative method for solving large-scale power flow problems, A trust-region framework for constrained optimization using reduced order modeling, A selective strategy for shakedown analysis of engineering structures, An interior-point implementation developed and tuned for radiation therapy treatment planning, Semismooth Reformulation and Nonsmooth Newton’s Method for Solving Nonlinear Semidefinite Programming, Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints, Handling infeasibility in a large-scale nonlinear optimization algorithm, A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties, Interior-point methods for nonconvex nonlinear programming: cubic regularization, An augmented Lagrangian filter method, On formation of security portfolio with uniform distribution by logarithmic criterion and priority risk component, Study of a primal-dual algorithm for equality constrained minimization, On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods, An exact penalty-Lagrangian approach for large-scale nonlinear programming, Reducing dimensionality in topology optimization using adaptive design variable fields, Design of maximum permeability material structures, Evolutionary techniques applied to the optimal short-term scheduling of the electrical energy production, Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs, Optimization-based approach to path planning for closed chain robot systems, The penalty interior-point method fails to converge, Interior point methods for large-scale nonlinear programming, Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts, A quasi-Newton interior point method for semi-infinite programming, On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, On the behaviour of constrained optimization methods when Lagrange multipliers do not exist, Solving mathematical programs with complementarity constraints as nonlinear programs, Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties, Global and local convergence of a filter line search method for nonlinear programming, A smoothing heuristic for a bilevel pricing problem, A line search SQP method without a penalty or a filter, Practical implementation of an interior point nonmonotone line search filter method, Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods, Hybridizing the electromagnetism-like algorithm with descent search for solving engineering design problems, Mixed integer nonlinear programming using interior-point methods, Assessing the potential of interior point barrier filter line search methods: nonmonotoneversusmonotone approach, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, From global to local convergence of interior methods for nonlinear optimization, Optimality properties of an augmented Lagrangian method on infeasible problems, A central path interior point method for nonlinear programming and its local convergence
Uses Software
