A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
From MaRDI portal
Recommendations
- On the Sequential Quadratically Constrained Quadratic Programming Methods
- Global and superlinear convergence of inexact sequential quadratically constrained quadratic programming method for convex programming
- A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
- Inexact sequential quadratically constrained quadratic programming methods with nonmonotone line searches for convex programming
- A sequential quadratically constrained quadratic programming method of feasible directions
Cited in
(35)- Single pass computation of first seismic wave travel time in three dimensional heterogeneous media with general anisotropy
- A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
- Global and superlinear convergence of inexact sequential quadratically constrained quadratic programming method for convex programming
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems
- A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
- On the Sequential Quadratically Constrained Quadratic Programming Methods
- New cooperative projection neural network for nonlinearly constrained variational inequality
- On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems
- A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
- A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization
- A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function
- An exact penalty method for nonconvex problems covering, in particular, nonlinear programming, semidefinite programming, and second-order cone programming
- On the convexity and existence of solutions to quadratic programming problems with convex constraint
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- A delayed weighted gradient method for strictly convex quadratic minimization
- A sequential quadratically constrained quadratic programming method of feasible directions
- A Sequential Minimization Technique for Elliptic Quasi-variational Inequalities with Gradient Constraints
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
- A global QP-free algorithm for mathematical programs with complementarity constraints
- A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
- A working set SQCQP algorithm with simple nonmonotone penalty parameters
- Newton-type methods: a broader view
- A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
- Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
- Inexact sequential quadratically constrained quadratic programming methods with nonmonotone line searches for convex programming
- A quadratically approximate framework for constrained optimization, global and local convergence
- A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results
- Projected Newton method for large-scale Bayesian linear inverse problems
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming
- Safe zeroth-order optimization using quadratic local approximations
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
This page was built for publication: A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4441939)
