scientific article; zbMATH DE number 5063983

Yinyu Ye, Michael C. Grant, Stephen P. Boyd

Publication date: 13 October 2006

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

Related Items (63)

A penalty method for rank minimization problems in symmetric matrices ⋮ Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers ⋮ A hybrid LP/NLP paradigm for global optimization relaxations ⋮ Exact approaches for competitive facility location with discrete attractiveness ⋮ A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm ⋮ Eigen-stratified models ⋮ Quantum hedging in two-round prover-verifier interactions ⋮ Optimization conditions and decomposable algorithms for convertible nonconvex optimization ⋮ Convex duality and calculus: Reduction to cones ⋮ Global method for learning an integrated temperature prediction model in a slab reheating furnace ⋮ Extended Formulations in Mixed-Integer Convex Programming ⋮ A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization ⋮ MathOptInterface: A Data Structure for Mathematical Optimization Problems ⋮ DrAmpl: A meta solver for optimization problem analysis ⋮ Pandemic risk management: resources contingency planning and allocation ⋮ Set-based control for disturbed piecewise affine systems with state and actuation constraints ⋮ Cooperative output regulation problem of discrete-time linear multi-agent systems with Markov switching topologies ⋮ SUSPECT: MINLP special structure detector for Pyomo ⋮ Disjunctive cuts in mixed-integer conic optimization ⋮ CVXGEN: a code generator for embedded convex optimization ⋮ Matrix-Free Convex Optimization Modeling ⋮ Outer approximation with conic certificates for mixed-integer convex problems ⋮ Designing experiments toward shrinkage estimation ⋮ Minimizing oracle-structured composite functions ⋮ Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization ⋮ Two-dimensional digital filters with sparse coefficients ⋮ Sparsity enforcing edge detection method for blurred and noisy Fourier data ⋮ Wavelet-based de-noising of positron emission tomography scans ⋮ Robust stabilization of stochastic Markovian jumping systems via proportional-integral control ⋮ Adaptive observer-based fault estimation for stochastic Markovian jumping systems ⋮ On-line optimal control of a class of discrete event systems with real-time constraints ⋮ Optimal transport over nonlinear systems via infinitesimal generators on graphs ⋮ Disciplined quasiconvex programming ⋮ Inferring stable genetic networks from steady-state data ⋮ Convex Optimization for Finite-Horizon Robust Covariance Control of Linear Stochastic Systems ⋮ Proximal alternating penalty algorithms for nonsmooth constrained convex optimization ⋮ Smoothing Partially Exact Penalty Function of Biconvex Programming ⋮ Generalized decomposition and cross entropy methods for many-objective optimization ⋮ A zero-forcing beamforming based time switching protocol for wireless powered Internet of things system ⋮ An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming ⋮ An interdiction game on a queueing network with multiple intruders ⋮ Adaptive smoothing algorithms for nonsmooth composite convex minimization ⋮ A convex optimization method to solve a filter design problem ⋮ Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices ⋮ JuMP: A Modeling Language for Mathematical Optimization ⋮ Graph Implementations for Nonsmooth Convex Programs ⋮ Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones ⋮ A novel neural dynamical approach to convex quadratic program and its efficient applications ⋮ Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem ⋮ Polyhedral approximation in mixed-integer convex optimization ⋮ Reformulations in Mathematical Programming: Definitions and Systematics ⋮ An objective penalty function method for biconvex programming ⋮ A Single-Phase, Proximal Path-Following Framework ⋮ CVX ⋮ Robust counterparts of errors-in-variables problems ⋮ Disciplined geometric programming ⋮ Estimating variances in time series kriging using convex optimization and empirical BLUPs ⋮ Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms ⋮ Convex optimization with an interpolation-based projection and its application to deep learning ⋮ The local integro splines with optimized knots ⋮ Generalized self-concordant functions: a recipe for Newton-type methods ⋮ Precise statistical analysis of classification accuracies for adversarial training ⋮ Unnamed Item

Uses Software

This page was built for publication: