On combining feasibility, descent and superlinear convergence in inequality constrained optimization
From MaRDI portal
Publication:2368081
DOI10.1007/BF01581247zbMath0794.90068MaRDI QIDQ2368081
Publication date: 22 August 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
global convergencesequential quadratic programminginequality constrained optimizationquasi-Newton techniquessuperlinear covergence
Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20)
Related Items (63)
Feasible methods for nonconvex nonsmooth problems with applications in green communications ⋮ A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity ⋮ A modified SQP algorithm for minimax problems ⋮ A superlinearly convergent hybrid algorithm for solving nonlinear programming ⋮ A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization ⋮ Neural net based model predictive control ⋮ A type of efficient feasible SQP algorithms for inequality constrained optimization ⋮ A sequential quadratic programming algorithm for nonlinear minimax problems ⋮ A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence ⋮ A parametric procedure for ultrametric tree estimation from conditional rank order proximity data ⋮ A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization ⋮ A simple feasible SQP algorithm for inequality constrained optimization ⋮ A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints ⋮ Self-tuning norm-relaxed method of feasible directions ⋮ Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions ⋮ Primal-dual interior point QP-free algorithm for nonlinear constrained optimization ⋮ Scatter search for chemical and bio-process optimization ⋮ A superlinearly convergent numerical algorithm for nonlinear programming ⋮ A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization ⋮ A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization ⋮ A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization ⋮ Adaptive model-based control using neural networks ⋮ Multivariate meta-analysis for data consortia, individual patient meta-analysis, and pooling projects ⋮ Canonical coordinates method for equality-constrained nonlinear optimization. ⋮ Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints ⋮ A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization ⋮ A new SQP method of feasible directions for nonlinear programming. ⋮ Solving kinematics problems by efficient interval partitioning ⋮ CFD-based optimization of aerofoils using radial basis functions for domain element parameterization and mesh deformation ⋮ Stochastic ultimate load analysis:models and solution methods1 ⋮ Shape optimization of two‐phase inelastic material with microstructure ⋮ Shape optimization of two‐phase inelastic material with microstructure ⋮ An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization ⋮ Efficient interval partitioning-local search collaboration for constraint satisfaction ⋮ A quadratically approximate framework for constrained optimization, global and local convergence ⋮ A new superlinearly convergent SQP algorithm for nonlinear minimax problems ⋮ High-fidelity aerodynamic shape optimization of modern transport wing using efficient hierarchical parameterization ⋮ A sequential equality constrained quadratic programming algorithm for inequality constrained optimization ⋮ A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences ⋮ Global and local convergence of a class of penalty-free-type methods for nonlinear programming ⋮ A superlinearly convergent method of feasible directions. ⋮ An improved sequential quadratic programming algorithm for solving general nonlinear programming problems ⋮ An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity ⋮ An efficient sequential quadratic programming algorithm for nonlinear programming ⋮ A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity ⋮ A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity ⋮ A feasible SQP method for nonlinear programming ⋮ CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm ⋮ Parameter optimization and uncertainty analysis in a model of oceanic CO\(_2\) uptake using a hybrid algorithm and algorithmic differentiation ⋮ Global and local convergence of a filter line search method for nonlinear programming ⋮ Least squares estimation techniques for position tracking of radioactive sources ⋮ A new SQP approach for nonlinear complementarity problems ⋮ On the relation between constant positive linear dependence condition and quasinormality constraint qualification ⋮ A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization ⋮ Explicit gradient information in multiobjective optimization ⋮ Generalized monotone line search SQP algorithm for constrained minimax problems ⋮ An SQP algorithm for mathematical programs with nonlinear complementarity constraints ⋮ Generalised monotone line search algorithm for degenerate nonlinear minimax problems ⋮ A feasible and superlinear algorithm for inequality constrained minimization problems ⋮ Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions ⋮ A globally and superlinearly convergent feasible QP-free method for nonlinear programming ⋮ Feasible direction algorithm for optimal control problems with state and control constraints: Implementation ⋮ Algorithms for optimal signal set design
Uses Software
Cites Work
- Unnamed Item
- Test examples for nonlinear programming codes
- A globally convergent method for nonlinear programming
- A Strategy for Global Convergence in a Sequential Quadratic Programming Algorithm
- A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints
- A recursive quadratic programming algorithm that uses differentiable exact penalty functions
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- A surperlinearly convergent algorithm for constrained optimization problems
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
This page was built for publication: On combining feasibility, descent and superlinear convergence in inequality constrained optimization
