A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
From MaRDI portal
Publication:2226311
Recommendations
- scientific article; zbMATH DE number 7071986
- An ADMM-based SQP method for separably smooth nonconvex optimization
- A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization
- Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems
- An SQCQP algorithm with new active identification set for inequality constrained optimization
Cites work
- A Globally Convergent Stabilized SQP Method
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- A quadratically-convergent algorithm for general nonlinear programming problems
- A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
- A strictly contractive Peaceman-Rachford splitting method for convex programming
- A successive quadratic programming algorithm with global and superlinear convergence properties
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
- A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
- A trust region SQP algorithm for mixed-integer nonlinear programming
- A trust-region SQP method without a penalty or a filter for nonlinear programming
- An efficient feasible SQP algorithm for inequality constrained optimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence study on the symmetric version of ADMM with larger step sizes
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Fast alternating direction optimization methods
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- Global Convergence of Filter Methods for Nonlinear Programming
- Global convergence of splitting methods for nonconvex composite optimization
- Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
- Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- Nonlinear programming without a penalty function.
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the convexity and existence of solutions to quadratic programming problems with convex constraint
- On the Global Convergence of a Filter--SQP Algorithm
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- On the Sequential Quadratically Constrained Quadratic Programming Methods
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization
- Preconditioned steepest descent methods for some nonlinear elliptic equations involving p-Laplacian terms
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Stabilized sequential quadratic programming
- Stabilized SQP revisited
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- Test examples for nonlinear programming codes
Cited in
(16)- An ADMM-based SQP method for separably smooth nonconvex optimization
- A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization
- Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure
- scientific article; zbMATH DE number 7071986 (Why is no real title available?)
- A method of sequential log-convex programming for engineering design
- Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems
- A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization
- Dual descent augmented Lagrangian method and alternating direction method of multipliers
- A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization
- A partially feasible Jacobi-type distributed SQO method for two-block general linearly constrained smooth optimization
- A half-proximal symmetric splitting method for non-convex separable optimization
- Monotone splitting SQP algorithms for two-block nonconvex optimization problems with general linear constraints and applications
- A splitting sequence quadratic programming algorithm for the large-scale nonconvex nonseparable optimization problems
- An exact penalty function optimization method and its application in stress constrained topology optimization and scenario based reliability design problems
- Augmented Lagrangian based sequential quadratic programming for a constrained inverse eigenvalue problem of a graph
- Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems
This page was built for publication: A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2226311)
