A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming

DOI10.1016/j.ejor.2007.01.026zbMath1175.90390MaRDI QIDQ2462105

Jin-Bao Jian, Dao Lan Han, Qing Juan Xu

Publication date: 23 November 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.01.026

zbMATH Keywords

global convergence; semi-infinite programming; superlinear convergence; norm-relaxed method of feasible direction

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

49M37: Numerical methods based on nonlinear programming

90C34: Semi-infinite programming

90C55: Methods of successive quadratic programming type

Related Items

Global convergence of a robust filter SQP algorithm

Uses Software

• FSQP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• A generalization of the norm-relaxed method of feasible directions
• Discretization methods for the solution of semi-infinite programming problems
• Norm-relaxed method of feasible directions for solving nonlinear programming problems
• A new SQP method of feasible directions for nonlinear programming.
• A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
• A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
• Information Theory and Statistical Mechanics
• A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
• A projected lagrangian algorithm for semi-infinite programming
• An implementation of a discretization method for semi-infinite programming
• An exact penalty function for semi-infinite programming
• A cutting-plane method for quadratic semi infinite programming problems
• An improved algorithm for optimization problems with functional inequality constraints
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
• An algorithm for optimization problems with functional inequality constraints
• A regularized penalty method for solving convex semi-infinite programs
• Rate of Convergence of a Class of Methods of Feasible Directions
• An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
• A superlinearly convergent method of feasible directions.