Interior point filter method for semi-infinite programming problems

DOI10.1080/02331934.2011.616894zbMath1231.90347OpenAlexW2062812796MaRDI QIDQ3111139

Ana Isabel P. N. Pereira, Edite M. G. P. Fernandes, M. Fernanda P. Costa

Publication date: 18 January 2012

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10198/7531

zbMATH Keywords

nonlinear optimizationsemi-infinite programmingline searchinterior pointfilter method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interior-point methods (90C51) Semi-infinite programming (90C34)

Related Items (5)

Integration of expert knowledge into radial basis function surrogate models ⋮ Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints ⋮ A filter-based artificial fish swarm algorithm for constrained global optimization: theoretical and practical issues ⋮ Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints ⋮ A line search filter inexact reduced Hessian method for nonlinear equality constrained optimization

Uses Software

• ipfilter

Cites Work

• Unnamed Item
• Feasible method for generalized semi-infinite programming
• Semi-infinite programming
• Generalized semi-infinite programming: a tutorial
• The semismooth approach for semi-infinite programming under the reduction ansatz
• Air pollution control with semi-infinite programming
• A new smoothing Newton-type algorithm for semi-infinite programming
• A smoothing projected Newton-type algorithm for semi-infinite programming
• A filter trust region method for solving semi-infinite programming problems
• A comparative study of several semi-infinite nonlinear programming algorithms
• An interior-point algorithm for nonconvex nonlinear programming
• Semismooth Newton methods for solving semi-infinite programming problems
• Robot trajectory planning with semi-infinite programming.
• A smoothing Newton method for semi-infinite programming
• Generalized semi-infinite programming: Theory and methods
• Numerical experiments in semi-infinite programming
• Very fast simulated re-annealing
• Objective function stretching to alleviate convergence to local minima.
• A globally convergent primal-dual interior-point filter method for nonlinear programming
• On the formulation and theory of the Newton interior-point method for nonlinear programming
• A homotopy interior point method for semi-infinite programming problems
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• On generalized semi-infinite optimization of genetic networks
• Semi-Infinite Programming: Theory, Methods, and Applications
• A reduction method for semi-infinite programming by means of a global stochastic approach†
• The Semismooth Approach for Semi-Infinite Programming without Strict Complementarity
• A projected lagrangian algorithm for semi-infinite programming
• Numerical Optimization
• Solving Semi-Infinite Optimization Problems with Interior Point Techniques
• Local Convergence of SQP Methods in Semi-Infinite Programming
• Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
• Line Search Filter Methods for Nonlinear Programming: Local Convergence
• Practical implementation of an interior point nonmonotone line search filter method
• Nonlinear programming without a penalty function.

This page was built for publication: Interior point filter method for semi-infinite programming problems