Pages that link to "Item:Q853883"
From MaRDI portal
The following pages link to A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming (Q853883):
Displaying 24 items.
- Extension of smoothing Newton algorithms to solve linear programming over symmetric cones (Q545466) (← links)
- Finite termination of a Newton-type algorithm for a class of affine variational inequality problems (Q613275) (← links)
- A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
- Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem (Q670858) (← links)
- A smoothing-type algorithm for solving system of inequalities (Q939536) (← links)
- Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem (Q942413) (← links)
- A non-interior-point smoothing method for variational inequality problem (Q966082) (← links)
- Smoothing algorithms for complementarity problems over symmetric cones (Q967217) (← links)
- Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization (Q975356) (← links)
- A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search (Q979319) (← links)
- A smoothing self-adaptive Levenberg-Marquardt algorithm for solving system of nonlinear inequalities (Q984338) (← links)
- Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem (Q1021504) (← links)
- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones (Q1040694) (← links)
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
- A non-interior continuation algorithm for solving the convex feasibility problem (Q1634140) (← links)
- Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines (Q2053310) (← links)
- A matrix-free smoothing algorithm for large-scale support vector machines (Q2279568) (← links)
- Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions (Q2430462) (← links)
- A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties (Q2480789) (← links)
- Robust solutions of uncertain complex-valued quadratically constrained programs (Q2519336) (← links)
- A smoothing Newton's method for the construction of a damped vibrating system from noisy test eigendata (Q3011667) (← links)
- Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization (Q5020852) (← links)
- Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems (Q5038440) (← links)
- A Nonmonotone Smoothing-Type Algorithm for a System of Inequalities Associated with Circular Cones (Q6053516) (← links)
