Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
From MaRDI portal
Publication:4018616
DOI10.1137/0729072zbMath0763.65042OpenAlexW2043851096MaRDI QIDQ4018616
No author found.
Publication date: 16 January 1993
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0729072
constrained optimizationsequential quadratic programmingsuperlinear convergencefeasibilitynonmonotone line searchMaratos effectsecond-order correctionfeasible points algorithm
Related Items
A class of nonmonotone stabilization trust region methods, Convergence properties of inexact projected gradient methods, A superlinearly convergent hybrid algorithm for solving nonlinear programming, A non-monotone trust region algorithm for unconstrained optimization with dynamic reference iteration updates using filter, Two globally convergent nonmonotone trust-region methods for unconstrained optimization, Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds, A simple feasible SQP algorithm for inequality constrained optimization, Unnamed Item, A superlinearly convergent numerical algorithm for nonlinear programming, A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization, An improved feasible QP-free algorithm for inequality constrained optimization, Spatiotemporal vaccine allocation policies for epidemics with behavioral feedback dynamics, The convergence of equilibrium algorithms with non-monotone line search technique., A new SQP method of feasible directions for nonlinear programming., Shape optimization of two‐phase inelastic material with microstructure, Shape optimization of two‐phase inelastic material with microstructure, A globally and superlinearly convergent modified SQP-filter method, A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function, A modified SQP method and its global convergence, A sequential equality constrained quadratic programming algorithm for inequality constrained optimization, A filter trust-region algorithm for unconstrained optimization with strong global convergence properties, An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity, A kind of nonmonotone filter method for nonlinear complementarity problem, A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity, A modified QP-free feasible method, A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity, A feasible SQP method for nonlinear programming, Convergence properties of nonmonotone spectral projected gradient methods, A class on nonmonotone stabilization methods in unconstrained optimization, Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs, A modified SQP-filter method and its global convergence, Wing aerodynamic optimization using efficient mathematically-extracted modal design variables, On the nonmonotone line search, On efficiency of nonmonotone Armijo-type line searches, A modified SQP method with nonmonotone technique and its global convergence, A feasible and superlinear algorithm for inequality constrained minimization problems, A superlinear convergence feasible sequential quadratic programming algorithm for bipedal dynamic walking robot via discrete mechanics and optimal control, Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods, A variant of curved search method, Nonmonotone line search for minimax problems
Uses Software
