scientific article; zbMATH DE number 729680

Publication date: 6 March 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

penalty function methods Newton type algorithms interior-point polynomial-time methods self- concordance

Convex programming (90C25) Interior-point methods (90C51) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (only showing first 100 items - show all)

Optimal exponential synchronization of general chaotic delayed neural networks: an LMI approach ⋮ On the construction of general cubature formula by flat extensions ⋮ Robust adaptive attenuation of unknown periodic disturbances in uncertain multi-input multi-output systems ⋮ Douglas-Rachford splitting method for semidefinite programming ⋮ Random sampling: billiard walk algorithm ⋮ On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature ⋮ CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization ⋮ Decomposition-based interior point methods for stochastic quadratic second-order cone programming ⋮ Conic optimization via operator splitting and homogeneous self-dual embedding ⋮ Sufficient optimality conditions hold for almost all nonlinear semidefinite programs ⋮ A linear-time algorithm for trust region problems ⋮ Methods for minimax estimation under elementwise covariance uncertainty ⋮ Derivatives of eigenvalues and Jordan frames ⋮ An inexact proximal method for quasiconvex minimization ⋮ Continuous multifacility ordered median location problems ⋮ Synchronization of delayed neural networks with Lévy noise and Markovian switching via sampled data ⋮ A logarithmic barrier approach for linear programming ⋮ Logarithmically homogeneous preferences ⋮ Computationally efficient approach for the minimization of volume constrained vector-valued Ginzburg-Landau energy functional ⋮ A trust region method for solving semidefinite programs ⋮ A novel LMI-based optimization algorithm for the guaranteed estimation of the domain of attraction using rational Lyapunov functions ⋮ Central swaths ⋮ Gradient methods for minimizing composite functions ⋮ A homotopy method for nonlinear semidefinite programming ⋮ Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs ⋮ New semidefinite programming relaxations for box constrained quadratic program ⋮ On the \(\infty\)-norm of the cubic form of complete hyperbolic affine hyperspheres ⋮ Stochastic nuclear outages semidefinite relaxations ⋮ An FPTAS for optimizing a class of low-rank functions over a polytope ⋮ A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization ⋮ A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming ⋮ Approximation accuracy, gradient methods, and error bound for structured convex optimization ⋮ Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms ⋮ New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems ⋮ Minimization of project time and cost under constrained reliability index in the disjunctive project model ⋮ Local convergence of Newton's method under majorant condition ⋮ Optimal detection of sparse principal components in high dimension ⋮ Enumeration approach to computing chemical equilibria ⋮ Domain adaptation and sample bias correction theory and algorithm for regression ⋮ A class of robust bounded controllers tracking a nonlinear discrete-time stochastic system: attractive ellipsoid technique application ⋮ CVXGEN: a code generator for embedded convex optimization ⋮ Robust formulations for clustering-based large-scale classification ⋮ Subgradient methods for huge-scale optimization problems ⋮ On the stable solution of large scale problems over the doubly nonnegative cone ⋮ Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones ⋮ Smoothed analysis of condition numbers and complexity implications for linear programming ⋮ An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem ⋮ New dilated LMI characterization for the multiobjective full-order dynamic output feedback synthesis problem ⋮ A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming ⋮ Constraint consensus methods for finding interior feasible points in second-order cones ⋮ Approximate level method for nonsmooth convex minimization ⋮ Computation of channel capacity based on self-concordant functions ⋮ Local convergence analysis of inexact Newton-like methods under majorant condition ⋮ Strict anisotropic norm bounded real lemma in terms of matrix inequalities ⋮ Lossless convexification of a class of optimal control problems with non-convex control constraints ⋮ Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming ⋮ Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming ⋮ On zero duality gap in nonconvex quadratic programming problems ⋮ A robust Kantorovich's theorem on the inexact Newton method with relative residual error tolerance ⋮ Surface fitting and registration of point clouds using approximations of the unsigned distance function ⋮ Robust univariate spline models for interpolating interval data ⋮ Robust portfolio selection involving options under a ``marginal+joint ellipsoidal uncertainty set ⋮ On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function ⋮ A fresh variational-analysis look at the positive semidefinite matrices world ⋮ A canonical dual approach for solving linearly constrained quadratic programs ⋮ Interior point methods 25 years later ⋮ Linear computational complexity robust ILC for lifted systems ⋮ Analysis of microstructures and phase transition phenomena in one-dimensional, non-linear elasticity by convex optimization ⋮ Design and optimization of buck and double buck converters by means of geometric programming ⋮ Robust control of uncertain systems: classical results and recent developments ⋮ Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria ⋮ Maximum divert for planetary landing using convex optimization ⋮ Control: a perspective ⋮ Lossless convexification of non-convex optimal control problems for state constrained linear systems ⋮ Full-NT step infeasible interior-point method for SOCO based on a specific kernel function ⋮ qpOASES: a parametric active-set algorithm for~quadratic programming ⋮ Quadratic optimization over a second-order cone with linear equality constraints ⋮ Calibration, sharpness and the weighting of experts in a linear opinion pool ⋮ \( H_\infty\) control for networked systems with multiple packet dropouts ⋮ Curvature of Hessian manifolds ⋮ Relative entropy optimization and its applications ⋮ Exactness criteria for SDP-relaxations of quadratic extremum problems ⋮ Semidefinite approximations of conical hulls of measured sets ⋮ An axiomatic duality framework for the theta body and related convex corners ⋮ Weak infeasibility in second order cone programming ⋮ Networked control design for coalitional schemes using game-theoretic methods ⋮ An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization ⋮ Inexact proximal Newton methods for self-concordant functions ⋮ A polynomial primal-dual affine scaling algorithm for symmetric conic optimization ⋮ Derivative of an integral over a convex polytope ⋮ Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices ⋮ Quadratic factorization heuristics for copositive programming ⋮ OSQP: An Operator Splitting Solver for Quadratic Programs ⋮ Convexity conditions of Kantorovich function and related semi-infinite linear matrix inequalities ⋮ Robust \(\mathcal S\)-regularity of matrix pencils applied to the analysis of descriptor models ⋮ Robust synchronization analysis in nonlinear stochastic cellular networks with time-varying delays, intracellular perturbations and intercellular noise ⋮ Speed scaling for maximum lateness ⋮ Randomized interior point methods for sampling and optimization ⋮ A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems ⋮ Generalized Gauss inequalities via semidefinite programming

This page was built for publication: