scientific article; zbMATH DE number 729680
From MaRDI portal
Publication:4324980
zbMATH Open0824.90112MaRDI QIDQ4324980FDOQ4324980
Authors: Arkadi Nemirovski, Yuri Nesterov 
Publication date: 6 March 1995
Title of this publication is not available (Why is that?)
Recommendations
penalty function methodsNewton type algorithmsinterior-point polynomial-time methodsself- concordance
Convex programming (90C25) Interior-point methods (90C51) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cited In (only showing first 100 items - show all)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Confidence structural robust optimization by non linear semidefinite programming-based single-level formulation
- Interior-point methods for nonlinear complementarity problems
- The tracial moment problem and trace-optimization of polynomials
- Kernel based support vector machine via semidefinite programming: application to medical diagnosis
- A finite steps algorithm for solving convex feasibility problems
- Matrix convex hulls of free semialgebraic sets
- Cuts for mixed 0-1 conic programming
- Mesh adaptive computation of upper and lower bounds in limit analysis
- Cubic regularization of Newton method and its global performance
- On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems
- Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation
- Douglas-Rachford splitting method for semidefinite programming
- On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature
- Decomposition-based interior point methods for stochastic quadratic second-order cone programming
- On approximating D-induced polar sets of a second-order cone by an ellipsoid
- A linear-time algorithm for trust region problems
- Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
- Local convergence of Newton's method under majorant condition
- 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
- Local convergence analysis of inexact Newton-like methods under majorant condition
- Approximate level method for nonsmooth convex minimization
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- Methods for minimax estimation under elementwise covariance uncertainty
- Derivatives of eigenvalues and Jordan frames
- An inexact proximal method for quasiconvex minimization
- Detecting rigid convexity of bivariate polynomials
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
- A class of volumetric barrier decomposition algorithms for stochastic quadratic programming
- Quadratic regularizations in an interior-point method for primal block-angular problems
- On the stable solution of large scale problems over the doubly nonnegative cone
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
- ACUTA: a novel method for eliciting additive value functions on the basis of holistic preference statements
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
- Block splitting for distributed optimization
- Quadratic expansions of spectral functions
- Interior-point Lagrangian decomposition method for separable convex optimization
- Continuous multifacility ordered median location problems
- Differential properties of Euclidean projection onto power cone
- Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme
- A novel LMI-based optimization algorithm for the guaranteed estimation of the domain of attraction using rational Lyapunov functions
- Stochastic nuclear outages semidefinite relaxations
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- Robust stability analysis of switched Hopfield neural networks with time-varying delay under uncertainty
- \( H_\infty\) control for networked systems with multiple packet dropouts
- On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
- Newton's method and its use in optimization
- A logarithmic barrier approach for linear programming
- Border basis relaxation for polynomial optimization
- Linear matrix inequalities in robustness analysis with multipliers
- Model predictive control for perturbed max-plus-linear systems
- Logarithmically homogeneous preferences
- Robust control of uncertain systems: classical results and recent developments
- A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
- Computationally efficient approach for the minimization of volume constrained vector-valued Ginzburg-Landau energy functional
- A trust region method for solving semidefinite programs
- Elementary optimality conditions for nonlinear SDPs
- Self-scheduled \({\mathcal H}_ \infty\) control of linear parameter-varying systems: A design example
- An interior-point smoothing technique for Lagrangian relaxation in large-scale convex programming†
- Conversion of some classes of fractional programming to second-order cone programming and solving it by potential reduction interior point method
- Optimal traffic light control for a single intersection
- Robust stability and performance analysis of uncertain systems using linear matrix inequalities
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- Optimal and robust waveform design for MIMO radars in the presence of clutter
- A robust numerical method for the \(\gamma\)-iteration in \(H_{\infty}\) control
- Synchronization of delayed neural networks with Lévy noise and Markovian switching via sampled data
- On the accuracy of the ellipsoid norm approximation of the joint spectral radius
- Specialized fast algorithms for IQC feasibility and optimization problems.
- Joint routing and rate allocation for multiple video streams in ad-hoc wireless networks
- Copositive programming
- Complementarity problems over symmetric cones: A survey of recent developments in several aspects
- An interior method for nonconvex semidefinite programs
- Some geometric results in semidefinite programming
- Optimal information dissemination strategy to promote preventive behaviors in multilayer epidemic networks
- Set-membership filtering for systems with sensor saturation
- Potential-reduction methods in mathematical programming
- On the computation of \(C^*\) certificates
- Semidefinite representation of convex sets
- Noncommutative convexity arises from linear matrix inequalities
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- An entire space polynomial-time algorithm for linear programming
- Solving semidefinite programming problems via alternating direction methods
- Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
- Conic geometric optimization on the manifold of positive definite matrices
- Optimizing acyclic traffic signal switching sequences through an extended linear complementarity problem formulation
- A robust optimization approach to wine grape harvesting scheduling
- Structural extension to logistic regression: Discriminative parameter learning of belief net classifiers
- Positive definite matrices and the S-divergence
- Robust control of discrete linear repetitive processes with parameter varying uncertainty
- Dynamic modeling and control of supply chain systems: A review
- Robust stability and stabilisation of 2d discrete state-delayed systems
- Identification for control: from the early achievements to the revival of experiment design
- Robust stability and stabilization of uncertain linear positive systems via integral linear constraints: \(L_{1}\)-gain and \(L_{\infty }\)-gain characterization
- Discretization schemes for Lyapunov-Krasovskii functionals in time-delay systems.
- Approximate cone factorizations and lifts of polytopes
- Output feedback model predictive control of uncertain norm-bounded linear systems
- Linear matrix inequality representation of sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4324980)
