Pages that link to "Item:Q4441939"

The following pages link to A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization (Q4441939):

Displaying 27 items.

• A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
• New cooperative projection neural network for nonlinearly constrained variational inequality (Q848365) (← links)
• A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function (Q939555) (← links)
• A quadratically approximate framework for constrained optimization, global and local convergence (Q943517) (← links)
• Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization (Q975356) (← links)
• A sequential quadratically constrained quadratic programming method for unconstrained minimax problems (Q1039448) (← links)
• Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
• An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming (Q1949595) (← links)
• Single pass computation of first seismic wave travel time in three dimensional heterogeneous media with general anisotropy (Q1983176) (← links)
• A global QP-free algorithm for mathematical programs with complementarity constraints (Q2069554) (← links)
• A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application (Q2226311) (← links)
• Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
• A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences (Q2252398) (← links)
• Newton-type methods: a broader view (Q2260691) (← links)
• New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate (Q2370024) (← links)
• Quadratically constraint quadratical algorithm model for nonlinear minimax problems (Q2378762) (← links)
• A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results (Q2434998) (← links)
• A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems (Q2435607) (← links)
• On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems (Q2479835) (← links)
• A sequential quadratically constrained quadratic programming method of feasible directions (Q2480785) (← links)
• Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs (Q2806813) (← links)
• A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization (Q2841139) (← links)
• An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming (Q2945128) (← links)
• A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem (Q5058916) (← links)
• A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization (Q5085233) (← links)
• A Globally Convergent SQCQP Method for Multiobjective Optimization Problems (Q5148405) (← links)