Pages that link to "Item:Q2756075"
From MaRDI portal
The following pages link to Lectures on modern convex optimization. Analysis, algorithms, and engineering applications (Q2756075):
Displaying 50 items.
- Minimax and Minimax Projection Designs Using Clustering (Q123949) (← links)
- Smooth minimization of non-smooth functions (Q128676) (← links)
- Integrated inventory control and facility location decisions in a multi-echelon supply chain network with hubs (Q264284) (← links)
- Suboptimal anisotropic filtering in a finite horizon (Q276184) (← links)
- Maximizing concave piecewise affine functions on the unitary group (Q276306) (← links)
- Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty (Q279517) (← links)
- On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature (Q297833) (← links)
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- Computing the distance between the linear matrix pencil and the completely positive cone (Q301674) (← links)
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
- Robust waveform design for MIMO radar with imperfect prior knowledge (Q308475) (← links)
- Efficient formulations of the material identification problem using full-field measurements (Q310270) (← links)
- Stability of discrete-time switching systems with constrained switching sequences (Q311969) (← links)
- On sublinear inequalities for mixed integer conic programs (Q312706) (← links)
- Assessment of hollow spheroid models for ductile failure prediction by limit analysis and conic programming (Q326061) (← links)
- A practical nonlinear dynamic framework for solving a class of fractional programming problems (Q330727) (← links)
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
- Lieb's concavity theorem, matrix geometric means, and semidefinite optimization (Q344905) (← links)
- An optimal variant of Kelley's cutting-plane method (Q344947) (← links)
- A robust model for a leader-follower competitive facility location problem in a discrete space (Q345745) (← links)
- SDP reformulation for robust optimization problems based on nonconvex QP duality (Q354630) (← links)
- A model-free no-arbitrage price bound for variance options (Q373003) (← links)
- On the maximization of the fundamental eigenvalue in topology optimization (Q373895) (← links)
- Sparse non Gaussian component analysis by semidefinite programming (Q374189) (← links)
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization (Q374638) (← links)
- Techniques for exploring the suboptimal set (Q374684) (← links)
- Global optimization of robust truss topology via mixed integer semidefinite programming (Q374690) (← links)
- Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming (Q378749) (← links)
- Optimal transportation under controlled stochastic dynamics (Q378799) (← links)
- Second-order cone programming formulations for a class of problems in structural optimization (Q381385) (← links)
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint (Q384213) (← links)
- Second-order cone programming with warm start for elastoplastic analysis with von Mises yield criterion (Q400001) (← links)
- Nonlinear dimensionality reduction by topologically constrained isometric embedding (Q408807) (← links)
- Market price-based convex risk measures: a distribution-free optimization approach (Q435754) (← links)
- Computational Cam clay plasticity using second-order cone programming (Q438095) (← links)
- Stochastic receding horizon control with output feedback and bounded controls (Q445037) (← links)
- Analysis of microstructures and phase transition phenomena in one-dimensional, non-linear elasticity by convex optimization (Q445496) (← links)
- The truncated moment problem via homogenization and flat extensions (Q452366) (← links)
- A new semidefinite programming relaxation scheme for a class of quadratic matrix problems (Q453058) (← links)
- Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria (Q460659) (← links)
- Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995) (← links)
- A first order method for finding minimal norm-like solutions of convex optimization problems (Q463716) (← links)
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization (Q463723) (← links)
- On the indefinite quadratic fractional optimization with two quadratic constraints (Q467422) (← links)
- Free semidefinite representation of matrix power functions (Q471947) (← links)
- On control of discrete-time state-dependent jump linear systems with probabilistic constraints: a receding horizon approach (Q473417) (← links)
- Risk-control approach for bottleneck transportation problem with randomness and fuzziness (Q475802) (← links)
- A reduced complexity MIN-plus solution method to the optimal control of closed quantum systems (Q481002) (← links)
- The \(\mathcal A\)-truncated \(K\)-moment problem (Q486690) (← links)
