Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
From MaRDI portal
Publication:1897451
DOI10.1007/BF02192227zbMATH Open0830.90125MaRDI QIDQ1897451FDOQ1897451
Recommendations
- scientific article; zbMATH DE number 764397
- Quasi-Newton modification of the linearization method
- A QP-free and superlinearly convergent algorithm for inequality constrained optimizations
- Publication:3201653
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
Cites Work
- scientific article; zbMATH DE number 4134923 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3513549 (Why is no real title available?)
- scientific article; zbMATH DE number 3520162 (Why is no real title available?)
- scientific article; zbMATH DE number 4114401 (Why is no real title available?)
- scientific article; zbMATH DE number 3342967 (Why is no real title available?)
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A Class of penalty functions for optimization problema with bound constraints
- A Convergence Theory for a Class of Quasi-Newton Methods for Constrained Optimization
- A multiplier method with automatic limitation of penalty growth
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- Dual Variable Metric Algorithms for Constrained Optimization
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- New Results on a Continuously Differentiable Exact Penalty Function
- On a class fo hybrid methods for smooth constrained optimization
- On the Characterization of q-Superlinear Convergence of Quasi-Newton Methods for Constrained Optimization
- On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic Programming
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
- Properties of updating methods for the multipliers in augmented Lagrangians
- Recursive quadratic programming methods based on the augmented lagrangian
- Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
Cited In (63)
- Title not available (Why is no real title available?)
- Total variation based community detection using a nonlinear optimization approach
- On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
- An SQP algorithm for mathematical programs with nonlinear complementarity constraints
- A truly variationally consistent and symmetric mortar-based contact formulation for finite deformation solid mechanics
- A two-stage active-set algorithm for bound-constrained optimization
- Title not available (Why is no real title available?)
- A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity
- A type of efficient feasible SQP algorithms for inequality constrained optimization
- A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity
- An active set strategy based on the multiplier function or the gradient.
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
- A feasible SQP method for nonlinear programming
- An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments
- A modified QP-free feasible method
- An accurate active set Newton algorithm for large scale bound constrained optimization.
- Sequential systems of linear equations method for general constrained optimization without strict complementarity
- A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares
- A penalty-function-free line search SQP method for nonlinear programming
- An active set quasi-Newton method with projected search for bound constrained minimization
- A globally and superlinearly convergent feasible QP-free method for nonlinear programming
- An active-set algorithmic framework for non-convex optimization problems over the simplex
- An efficient feasible SQP algorithm for inequality constrained optimization
- A superlinearly convergent numerical algorithm for nonlinear programming
- An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems
- A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints
- Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions
- Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation
- A globally and superlinearly convergent modified SQP-filter method
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY
- Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
- A new SQP method of feasible directions for nonlinear programming.
- A feasible active set method with reoptimization for convex quadratic mixed-integer programming
- A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations
- A kind of QP-free feasible method
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
- A nonmonotone filter method for nonlinear optimization
- A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
- An efficient sequential quadratic programming algorithm for nonlinear programming
- A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization
- An improved feasible QP-free algorithm for inequality constrained optimization
- A sequential quadratically constrained quadratic programming method of feasible directions
- An active set sequential quadratic programming algorithm for nonlinear optimisation
- Modified active set projected spectral gradient method for bound constrained optimization
- A simple feasible SQP algorithm for inequality constrained optimization
- A truncated Newton method in an augmented Lagrangian framework for nonlinear programming
- An augmented Lagrangian method exploiting an active-set strategy and second-order information
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- Title not available (Why is no real title available?)
- A working set SQCQP algorithm with simple nonmonotone penalty parameters
- Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming
- A decomposition method for Lasso problems with zero-sum constraint
- An exact penalty-Lagrangian approach for large-scale nonlinear programming
- An infeasible active-set QP-free algorithm for general nonlinear programming
- A feasible and superlinear algorithm for inequality constrained minimization problems
- Convergence rates of a multilevel method for the regularization of nonlinear ill-posed problems
- An improved SQP algorithm for solving minimax problems
- An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
- A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization
This page was built for publication: Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897451)
