An SQP method for general nonlinear programs using only equality constrained subproblems
From MaRDI portal
(Redirected from Publication:1290629)
Recommendations
- A feasible SQP method for nonlinear programming
- scientific article; zbMATH DE number 5263084
- An SQP algorithm with equality constrained subproblems for nonlinear inequality constrained optimization
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
Cites work
- scientific article; zbMATH DE number 3868524 (Why is no real title available?)
- scientific article; zbMATH DE number 4213340 (Why is no real title available?)
- scientific article; zbMATH DE number 3965826 (Why is no real title available?)
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 3709953 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 724208 (Why is no real title available?)
- scientific article; zbMATH DE number 232211 (Why is no real title available?)
- scientific article; zbMATH DE number 3382096 (Why is no real title available?)
- A Penalty Function Method Converging Directly to a Constrained Optimum
- A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem
- A new technique for inconsistent QP problems in the SQP method
- A set of geometric programming test problems and their solutions
- A surperlinearly convergent algorithm for constrained optimization problems
- An Exact Penalization Viewpoint of Constrained Optimization
- An analysis of reduced Hessian methods for constrained optimization
- Exact penalty function algorithm with simple updating of the penalty parameter
- Local Convergence of a Two-Piece Update of a Projected Hessian Matrix
- More test examples for nonlinear programming codes
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- Nonlinear programming via an exact penalty function: Global analysis
- Numerically stable methods for quadratic programming
- On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem
- Partitioned quasi-Newton methods for nonlinear equality constrained optimization
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
- Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- Sequential Quadratic Programming Methods Based on Approximating a Projected Hessian Matrix
- Sparse Matrix Methods in Optimization
- Test examples for nonlinear programming codes
- The Effects of Rounding Error on an Algorithm for Downdating a Cholesky Factorization
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
Cited in
(40)- On the influence of constitutive models on shape optimization for artificial blood pumps
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
- scientific article; zbMATH DE number 5263084 (Why is no real title available?)
- Shape optimization of systems governed by Bernoulli free boundary problems
- Numerical method for optimum motion of undulatory swimming plate in fluid flow
- An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
- Adjoint-based error control for the simulation and optimization of gas and water supply networks
- A feasible SQP method for nonlinear programming
- A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization
- Sensitivity of optimal shapes of artificial grafts with respect to flow parameters
- Effective relaxation for microstructure simulations: algorithms and applications
- Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- An intelligent moving object optimization algorithm for design problems with mixed variables, mixed constraints and multiple objectives
- Improving solver success in reaching feasibility for sets of nonlinear constraints
- Shape control of Bézier surfaces with iso-parametric monotone curvature constraints
- Quantitative portfolio selection: using density forecasting to find consistent portfolios
- Solving constrained optimization problems using a novel genetic algorithm
- Hybrid pattern search and simulated annealing for fuzzy production planning problems
- Stochastic approach for the solution of multi-pantograph differential equation arising in cell-growth model
- Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space
- W-methods in optimal control
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- Optimization for a special class of traffic flow models: combinatorial and continuous approaches
- Numerical experience with sequential quadratic programming algorithms for equality constrained nonlinear programming
- DrAmpl: A meta solver for optimization problem analysis
- Optimization
- Capacity drop and traffic control for a second order traffic model
- Novel solution framework for inverse problem considering interval uncertainty
- Topology optimization in Bernoulli free boundary problems
- Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
- A subspace SQP method for equality constrained optimization
- Pricing general insurance with constraints
- A hybrid multilevel approach for aeroelastic optimization of composite wing-box
- A practical optimality condition without constraint qualifications for nonlinear programming
- Fast and reliable transient simulation and continuous optimization of large-scale gas networks
- A continuous buffer allocation model using stochastic processes
- An SQP method for equality constrained optimization on Hilbert manifolds
- 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
This page was built for publication: An SQP method for general nonlinear programs using only equality constrained subproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290629)
