Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
From MaRDI portal
Publication:5426900
DOI10.1137/04061427XzbMath1136.90039OpenAlexW2065986800MaRDI QIDQ5426900
Publication date: 16 November 2007
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/04061427x
interior point methodsymmetric conecomplementarity problemdetecting infeasibilityhomogeneous algorithmexistence of trajectory
Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Related Items (max. 100)
Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P*(κ) nonlinear complementarity problems over symmetric cones ⋮ Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP ⋮ Some P-properties of the quadratic representations and automorphism invariance in Euclidean Jordan algebras ⋮ Solvability based on E-property for the nonlinear symmetric cone complementarity problem ⋮ An inexact smoothing method for the monotone complementarity problem over symmetric cones ⋮ An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function ⋮ The parameter-Newton iteration for the second-order cone linear complementarity problem ⋮ Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems. ⋮ Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones ⋮ The modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems ⋮ A damped Gauss-Newton method for the second-order cone complementarity problem ⋮ Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP ⋮ A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS ⋮ A regularized smoothing Newton method for solving SOCCPs based on a new smoothing C-function ⋮ Properties of a Class of Nonlinear Transformations Over Euclidean Jordan Algebras with Applications to Complementarity Problems ⋮ Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones ⋮ A smoothing Newton method for the second-order cone complementarity problem. ⋮ A generalized smoothing Newton method for the symmetric cone complementarity problem ⋮ The matrix splitting iteration method for nonlinear complementarity problems associated with second-order cone ⋮ Convergence of a non-interior continuation algorithm for the monotone SCCP ⋮ The GUS-property of second-order cone linear complementarity problems ⋮ Stationary point conditions for the FB merit function associated with symmetric cones ⋮ Anderson accelerating the preconditioned modulus approach for linear complementarity problems on second-order cones ⋮ A new extension of Chubanov's method to symmetric cones ⋮ Several Jordan-algebraic aspects of optimization† ⋮ A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones ⋮ A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones ⋮ Pseudomonotonicity of nonlinear transformations on Euclidean Jordan algebras ⋮ Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions ⋮ A proximal point algorithm for the monotone second-order cone complementarity problem ⋮ Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems ⋮ An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems ⋮ The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems ⋮ A new nonmonotone smoothing Newton method for the symmetric cone complementarity problem with the Cartesian \(P_0\)-property ⋮ Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones ⋮ A homogeneous smoothing-type algorithm for symmetric cone linear programs ⋮ Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search ⋮ A new projected Barzilai-Borwein method for the symmetric cone complementarity problem ⋮ A homogeneous model for monotone mixed horizontal linear complementarity problems ⋮ The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra ⋮ On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem ⋮ A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones ⋮ A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems ⋮ On the approximate augmented Lagrangian for nonlinear symmetric cone programming ⋮ Improved smoothing Newton methods for symmetric cone complementarity problems ⋮ The same growth of FB and NR symmetric cone complementarity functions ⋮ Lyapunov-type least-squares problems over symmetric cones ⋮ An efficient algorithm for second-order cone linear complementarity problems ⋮ Smoothing algorithms for complementarity problems over symmetric cones ⋮ Extension of smoothing Newton algorithms to solve linear programming over symmetric cones ⋮ A globally and quadratically convergent smoothing Newton method for solving second-order cone optimization ⋮ The penalized Fischer-Burmeister SOC complementarity function ⋮ A merit function method for infinite-dimensional SOCCPs ⋮ Analysis of nonsmooth vector-valued functions associated with infinite-dimensional second-order cones ⋮ Two Classes of Merit Functions for Infinite-Dimensional Second Order Complimentary Problems ⋮ A smoothing Newton method for symmetric cone complementarity problems ⋮ A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP*(κ) horizontal linear complementarity problems over symmetric cones ⋮ Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions ⋮ A smoothing Newton algorithm for solving the monotone second-order cone complementarity problems ⋮ The convergence of a modified smoothing-type algorithm for the symmetric cone complementarity problem ⋮ A linearly convergent derivative-free descent method for the second-order cone complementarity problem ⋮ Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects ⋮ An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones ⋮ A modified LM algorithm for tensor complementarity problems over the circular cone ⋮ A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search ⋮ A nonmonotone smoothing Newton algorithm for weighted complementarity problem ⋮ On theP*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones ⋮ VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS ⋮ Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones ⋮ Predictor-corrector inexact smoothing algorithm for symmetric cone complementarity problems with Cartesian \(P_0\)-property ⋮ Unnamed Item ⋮ A projection and contraction method for symmetric cone complementarity problem ⋮ A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones ⋮ Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search ⋮ Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones ⋮ An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function ⋮ Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP∗(κ)-LCP over symmetric cones ⋮ Analysis of smoothing-type algorithms for the convex second-order cone programming ⋮ Infeasible path-following interior point algorithm for Cartesian P*(κ) nonlinear complementarity problems over symmetric cones ⋮ A smoothing Newton method for symmetric cone complementarity problem
Uses Software
This page was built for publication: Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
