An SQP method for general nonlinear programs using only equality constrained subproblems

DOI10.1007/BF01580078zbMath0930.90082MaRDI QIDQ1290629

P. Spellucci

Publication date: 3 June 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

sequential quadratic programmingnonlinear programmingSQP methodsequential equality constrained quadratic programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items

Topology optimization in Bernoulli free boundary problems, A continuous buffer allocation model using stochastic processes, Adjoint-based error control for the simulation and optimization of gas and water supply networks, Stochastic approach for the solution of multi-pantograph differential equation arising in cell-growth model, Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems, Shape control of Bézier surfaces with iso-parametric monotone curvature constraints, Fast and reliable transient simulation and continuous optimization of large-scale gas networks, Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space, DrAmpl: A meta solver for optimization problem analysis, Primal-dual interior point QP-free algorithm for nonlinear constrained optimization, A hybrid multilevel approach for aeroelastic optimization of composite wing-box, Capacity drop and traffic control for a second order traffic model, Hybrid pattern search and simulated annealing for fuzzy production planning problems, Novel solution framework for inverse problem considering interval uncertainty, A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization, On the Influence of Constitutive Models on Shape Optimization for Artificial Blood Pumps, A practical optimality condition without constraint qualifications for nonlinear programming, An intelligent moving object optimization algorithm for design problems with mixed variables, mixed constraints and multiple objectives, W-methods in optimal control, Sensitivity of optimal shapes of artificial grafts with respect to flow parameters, Optimization for a special class of traffic flow models: combinatorial and continuous approaches, Improving solver success in reaching feasibility for sets of nonlinear constraints, A sequential equality constrained quadratic programming algorithm for inequality constrained optimization, Numerical method for optimum motion of undulatory swimming plate in fluid flow, An improved sequential quadratic programming algorithm for solving general nonlinear programming problems, Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization, A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience, A feasible SQP method for nonlinear programming, A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization, A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization, Optimization, Quantitative portfolio selection: using density forecasting to find consistent portfolios, Shape optimization of systems governed by Bernoulli free boundary problems, Pricing general insurance with constraints, Solving constrained optimization problems using a novel genetic algorithm, Effective relaxation for microstructure simulations: algorithms and applications

Cites Work

• The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
• More test examples for nonlinear programming codes
• Test examples for nonlinear programming codes
• Partitioned quasi-Newton methods for nonlinear equality constrained optimization
• A new technique for inconsistent QP problems in the SQP method
• Representations of quasi-Newton matrices and their use in limited memory methods
• Exact penalty function algorithm with simple updating of the penalty parameter
• An analysis of reduced Hessian methods for constrained optimization
• On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem
• Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
• Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization
• A surperlinearly convergent algorithm for constrained optimization problems
• Nonlinear programming via an exact penalty function: Global analysis
• Nonlinear programming via an exact penalty function: Asymptotic analysis
• An Exact Penalization Viewpoint of Constrained Optimization
• A set of geometric programming test problems and their solutions
• A Penalty Function Method Converging Directly to a Constrained Optimum
• Numerically stable methods for quadratic programming
• The Effects of Rounding Error on an Algorithm for Downdating a Cholesky Factorization
• Sequential Quadratic Programming Methods Based on Approximating a Projected Hessian Matrix
• Local Convergence of a Two-Piece Update of a Projected Hessian Matrix
• A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem
• Sparse Matrix Methods in Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item